Unit 2.1 Algorithms

Unit 2.1 Algorithms

1. Binary Search

   • Put the list in order
   • Take the middle value
   • Is it the value you want?
   • ELIF it is larger take the list of values to the left.
   • ELIF it is smaller take the list of values to the right.
   • Repeat until you get the desired value.

2. Linear Search

   • Check the first value
   • If it is the wanted value then stop
   • ELIF, Check the next value
   • Repeat until all have been checked.

3. Bubble Sort

   • Take the first and second elements.
   • ELSE, Do Nothing
   • Do this until you can go all the way through without making any changes.

4. Merging Lists

   • Repeat until merged.
   • Split all elements into individual lists
   • Compare the first element in both lists.
   • Put the smallest in a new list

5. Merge Sort

   • Split a list into individual lists, of one element each
   • Merge the lists in pairs putting the smallest first
   • Merge until it is all in order

6. Insertion Sort

   • The rest are 'unsorted' list
   • Compare the unsorted element to each element in the sorted list
   • If it is smaller, put it in front of that element
   • ELIF it is larger, compare with next value
   • Repeat until all elements are 'sorted'

7. Flowcharts

   • They are used to represent algorithms
   • Shows the data that is input and output
   • Shows the processes taking place
   • Shows the decisions and repetitions
   • Lines/Arrows show the flow of control