Crash Course Computer Science # 13 - Algorithms

The function we wrote last episode to calculate exponents is _____ possible solution.

• the only

• only one

Who is considered one of the fathers of algebra?

• Albert Einstein

• Isaac Newton

• Muḥammad ibn Mūsā al-Khwārizmī

• Charles Babbage

What is a key aspect of computer science?

• Memorizing binary codes

• Learning foreign languages

• Crafting efficient algorithms

• Studying historical texts

What is an example of a sorting algorithm?

• Python

• Bubble Sort

• Einstein Algorithm

• Newton's Law

What is an array?

• A series of items stored in memory

• A programming language

• A type of algorithm

• A computer hardware component

How does sorting work? Consider the "Flights to Indianapolis" example.

• scanning an array of data

• manually picking out outliers

• creating a table to organize data

• generating a list of data to move into groups

The relationship of ​ (a)   size to the ​ (b)   the algorithm takes to run characterizes the ​ (c)   of the Selection Sort algorithm.

• input
• number of steps
• complexity
• output
• simplicity

What is the result of increasing an array's size from 8 to 80 in Selection Sort?

• The running time increases by 10 times

• The running time remains the same

• The running time increases by 100 times

• The running time decreases

What does 'Big O' notation describe?

• The efficiency of an algorithm

• The speed of the internet

• The cost of a computer

• The size of an object

How would you write Big O notation?

• O(log n)

• O(n²)

• O(n)

• O(n log n)