Intro to Algorithms

Front

The specific steps used to complete a computation is called ___

Back

an algorithm

Front

Some algorithms are better than others even if they ___

Back

produce equal results

Front

Generally, an algorithm is better if it takes ___

Back

fewer steps to compute

Front

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

Back

algebra

Front

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

Back

sorting

Front

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

Back

Bubble Sort and Spaghetti Sort

Front

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

Back

an array

Front

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

Back

Selection Sort

Front

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

Back

complexity of the algorithm

Front

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

Back

Big O Notation