Comp Sci Vocab

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

a finite set of instructions that accomplish a task

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

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.

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. Divide and conquer.

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

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

Straightforward method of solving a problem that relies on sheer computing power and trying every possibility rather than advanced techniques to improve efficiency

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

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