Algorithms

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

• Problem

• Algorithim

• Sequencing

• Selection

A finite set of instructions that accomplish a task

-Can be natural language, pseudocode, and diagrams

-Can be combined using sequencing, selection, and iteration

-

• Algorithim

• Sequencing

• Problem

• Selection

Putting steps in an order

• Sequencing

• Selection

• Problem

• Algorithim

Deciding which steps to do next

• Sequencing

• Selection

• Iteration

• Algorithim

Doing some steps over and over again

• Iteration

• Efficiency

• Selection

• Sequencing

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

• Efficiency

• Iteration

• Sequencing

• Selection

A search algorithim which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked.

• Linear Search

• Efficiency

• Iteration

• Selection

A search algorithim 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

• Binary Search

• Linear Search

• Algorithim

• Sequencing

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

• Unreasonable time

• Reasonable time

• Binary Search

• Linear Search

Algorithms with exponential or factorial efficiencies are examples of this

• Unreasonable time

• Reasonable time

• Binary Search

• Linear Search