Some algorithms are better than others even if they ___

Generally, an algorithm is better if it takes ___

The term algorithm comes from a Persian polymath who was one of the fathers of ___

One of the most storied algorithmic problems in all of computer science is ___

Computer Scientists have spent decades inventing algorithms for sorting, with cool names like ___

A series of items of the same type, like airfare prices, is called ___

The algorithm that sorted an array by repeatedly finding the smallest element was called ___

The relationship of input size to the number of steps the algorithm takes to run characterizes the ___

Which notation is used in Computer Science to describe the performance or complexity of an algorithm?

In the Selection Sort algorithm, increasing the array from 8 to 80 items increases the running time by a factor of ___

The second sorting algorithm, which started by dividing the input array in two halves, is called ___

In every loop of Merge Sort, we start with two arrays, each individually sorted, and merge them into ___

The “Big O” computational complexity of Merge Sort is ___

Compared to the efficiency of Selection Sort, Merge Sort is ___

In the "graph search" algorithmic problem, a graph is a network of nodes connected by ___

In the "graph search" algorithmic problem, each line is labeled with ___

In a graph search, trying every single path exhaustively and calculating the total cost of each is called ___

Who invented the classic algorithmic solution to the graph problem?

Dijkstra's algorithm always starts with ___

Dijkstra's original "graph search" algorithm was conceived in what year?

Dijkstra's original 1956 algorithm, where n is the number of nodes, had a complexity of ___

Every time you use a service like Google Maps to find directions, which kind of algorithm is running?