Unit 10 Algorithms

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

• Algorithm

• Sequencing

• Problem

• Selection

a finite set of instructions that accomplish a task.

• Problem

• Selection

• Efficiency

• Algorithm

putting steps in an order.

• Efficiency

• Sequencing

• Iteration

• Selection

deciding which steps to do next.

• Sequencing

• Selection

• Iteration

• Efficiency

a measure of how many steps are needed to complete an algorithm

• Linear Search

• Sequencing

• Selection

• Efficiency

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.

• Binary Search

• Linear Search

• Polynomial

• Exponential

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.

• Binary Search

• Linear Search

• Polynomial

• Exponential

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

• Heuristic

• Unreasonable Time

• Reasonable Time

• Decision Problem

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

• Heuristic

• Unreasonable Time

• Reasonable Time

• Decision Problem

A problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer

• Heuristic

• Unreasonable Time

• Reasonable Time

• Undecidable Problem