sorting algorithm

sorting algorithm

1. bubble sort

   • how it works
     • it starts at the beginning of the list
     • then it compares the first value in the list with the next one. if the first value is bigger it swaps them
     • then it goes to the next values in the list and compares
     • repeats this untill there are no more items to compare
     • go back to the start of the list
   • advantages
     • its the simplest sorting algorithm
   • disadvantages
     • slow for long list of code

2. merge sort

   • how it works
     • list splits into half
       • when all elements are individually separated
         • The algorithm looks at the individual elements and compares them as pairs. Each pair is sorted into order:
   • advantages
     • merge sort is a more efficient sort
   • disadvantages
     • take longer in shorter lists

3. insertion sort

   • how it works
     • the sort goes to the second value
       • and switches the one next to it
   • advantages
     • more efficient than bubble sort
   • disadvantages
     • large data sets are more efficiently handled by merge