CSP U10

Algorithm

a finite set of instructions that accomplish a task

Iteration

repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met.

Problem

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

Selection

putting steps in an order

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

Efficiency

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

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.

Reasonable time

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

Unreasonable time

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

Decision Problem

A problem with a yes/no answer

Heuristic

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

Optimization Problem

A problem with the goal of finding the "best" solution among many.

Undecidable problem

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

Distributed Computing

A model in which programs are run by multiple devices

Parallel Computing

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

Sequential Computing

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

Speedup

the time used to complete a task sequentially divided by the time to complete a task in parallel.