Algorithms

Algorithms

1. sorting

   • merge sort
   • insertion sort
   • bubble sort
     • sorts through and compares adjacent values
       • sorts each 2
     • slow and inpractical
     • at the end it does one last sweep to check all values are sorted

2. searching

   • linear search
     • doesn't have to be in order
     • takes more time the longer the list
     • if the target is near the beginning it will find it quickly
   • binary search
     • takes the middle number in the sequence and compares with the target.
       • if larger it lops of the right hand side
       • if smaller it removes the left hand side.
     • only works if list is in order
     • much quicker than linear search

Bilder und Dateien der Mindmap