2.1 Algorthims

2.1 Algorthims

1. Merge Sort

   • Splits a list into individual lists
   • merge the list into pairs putting the smallest first

2. Bubble Sort

   • Take the first and second elements
   • Compare them
   • if element 1 > 2 , swap them

3. Flowcharts

   • Set shapes are used; START/END is a oval, INPUT/OUTPUT is a parrallelogram, PROCESSES are rectangles and DECISIONS are diamonds with YES/NO coming off on diffrent branches
   • Shows the process taking place
   • shows the data that is input and output

4. Binary Search

   • Put the list in order
   • take the value in the middle
   • Is it the value you want?
   • ELIF it is larger take the rest of the values to the left