APCSP Unit 10 Algorithm Vocabulary

Front

What is a Problem in the context of algorithms?

Back

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

Front

Algorithm

Back

A step-by-step procedure for solving a problem or accomplishing a task

Front

Sequencing in algorithms refers to:

Back

The order in which instructions are executed

Front

Selection in the context of algorithms refers to the process of:

Back

• deciding which steps to do next.

Front

Iteration in algorithms

Back

A process of repeating a set of instructions a specified number of times or until a condition is met.

Front

Efficiency in the context of algorithms is defined as:

Back

The amount of time and steps an algorithm uses.

Front

Linear Search

Back

Linear Search is a method for finding a target value within a list by checking each element sequentially.

Front

Binary Search

Back

A method for finding a specific value in a sorted array (list) by repeatedly dividing the search interval in half

Front

Reasonable Time in the context of algorithms is defined as:

Back

The time taken by an algorithm that is polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time.

Front

Unreasonable Time in algorithms refers to

Back

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