algorithm efficiency linear and binary search unreasonable tijme heuristic undecidable problem sequential computing parallel computing distributive computing

Linear Search

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.

Unreasonable Time

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

Algorithm:

a finite set of instructions that accomplish a task

Efficiency

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

Parallel Computing

a model in which programs are broken into small pieces, some of which are run simultaneously

Distributed Computing

a model in which programs are run by multiple devices

Sequential Computing

a model in which programs run in order, one command at a time.

Undecidable Problem

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

Binary 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.

Heuristic

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