Linear Binary etc test prep

Linear Search

A search algorithm that searches every item in a list.

Worst Case Scenario of Linear Search

The worst case scenario is the number of items in the list.

Binary Search

A search algorithm that requires all items to be sorted.

Worst Case Scenario of Binary Search

Keep cutting the list in half until you can't.

Run Time Efficient

A measure indicating that the computational time is manageable based on the number of inputs.

n (in algorithms)

Represents the number of inputs.

Efficiency of algorithms with n² or n³

Algorithms with n² or n³ complexities are considered run time efficient.

Inefficiency of algorithms with 2^n

Algorithms with a complexity of 2^n are not run time efficient.

Inefficiency of algorithms with n!

Algorithms with a complexity of n! are not run time efficient and would require a heuristic.

Heuristic

A method that provides a 'good enough' solution to a problem when an exact solution is impractical or impossible.

Sequential Computing

A computing process where programs run in order, one command at a time.

Parallel Computing

A computing method where programs are broken into smaller pieces that can run simultaneously.

Execution time in Parallel Computing

Execution time is optimized when the workload of processors is as close to equal as possible.

Undecidable Problem

A problem for which no algorithm can be constructed that always provides a correct yes-or-no answer.