2.5 algorithms

2.5 algorithms

1. merge sort- a lsit is split into indivdual lists, these are then combined

2. ist- a set of data

3. Merging list

   • split elements into individual lists.
   • compare the first element in both lists
   • put the smallest into a new list
   • compare the next element of 1 list with the second element on the 2nd list
   • put the smallest into a new list
   • repeat until merged

4. merge sort

   • split a list into individual lists
   • merge lists in pairs,putting the smallest first
   • merge the list
   • keep merging until in order