AP CSP Vocab: Units 0,1, and 2

Front

Algorithm

Back

A finite set of instructions that accomplish a task.

Front

Iteration

Back

A repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met.

Front

Problem

Back

A general description of a task that can (or cannot) be solved with an algorithm.

Front

Selection

Back

Deciding which steps to do next.

Front

Sequencing

Back

Putting steps in an order.

Front

Binary Search

Back

A search algorithm that starts at the middle of a sorted set of numbers and removes half of the data; this process repeats until the desired value is found or all elements have been eliminated.

Front

Efficiency

Back

A measure of how many steps are needed to complete an algorithm.

Front

Linear Search

Back

A search algorithm which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked.

Front

Reasonable Time

Back

Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time.

Front

Unreasonable Time

Back

Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time.