a finite set of instructions that accomplish a task.

Deciding which steps to do next

Doing the same steps over and over

Go through every possible value starting at the beginning of the list until the value is found or the end of the list is found

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

Sequential/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.

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.

Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) 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.

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

Steps are performed in order, one at a time.

Some steps are performed at the same time.

Sequential time divided by parallel time

Help

Options

focusNode

Didn't know it?
click below

Knew it?
click below

Don't Know

Remaining cards (0)

Know

retry

shuffle

restart

0:00

Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

Normal Size Small Size show me how

APCSP - Unit 6

APCSP - Unit 6: Algorithms

Term	Definition
Algorithm	a finite set of instructions that accomplish a task.
Sequencing	Putting steps in an order
Selection	Deciding which steps to do next
Iteration	Doing the same steps over and over
Sequential Search	Go through every possible value starting at the beginning of the list until the value is found or the end of the list is found
Efficiency	a measure of how many steps are needed to complete an algorithm
Sequential/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.
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.
Reasonable Time	Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time.
Unreasonable Time	Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time.
Heuristic	provides a "good enough" solution to a problem when an actual solution is impractical or impossible
Undecidable Problem	a problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer
Sequential	Steps are performed in order, one at a time.
Parallel	Some steps are performed at the same time.
Speedup	Sequential time divided by parallel time
O(n)	Sequential Search
O(log n)	Binary Search
O(n^2)	Quadratic/Polynomial
O(2^n)	Exponential Search
O(1)	Constant Search

Created by: 131152

"Know" box contains:
Time elapsed:
Retries: