U6 - Algorithms - Vocab

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

• Problem

• Heuristic

• Quandry

• Question

 a finite set of instructions that accomplish a task.

• Algorithm

• Abstraction

• Sequencing

• Computing

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

• Efficiency

• SPA (Steps per algorithm)

• Flights of stairs

• Size

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.

• Linear Search

• Binary Search

• Recursive Search

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.

• Linear Search

• Binary Search

• Recursive Search

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

• reasonable time

• unreasonable time

• good time

Algorithms with exponential or factorial efficiencies are examples of algorithms that run in ______________.

• reasonable time

• unreasonable time

• good time

Algorithms that solve a problem, but take too long, especially as the data grows runs in ____________.

• reasonable time

• unreasonable time

• good time

 provides a "good enough" solution to a problem when an actual solution is impractical or impossible

• Heuristic

• GE

• Hopeful

• Appropriate

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

• Undecidable Problem

• Unreasonable Time

• Tough Problem