Sorting algorithms

Sorting algorithms

1. Bubble sort

   • Disadvantages
     • Unsuitable for large lists or data. because it takes to long to sort.
     • Their are more effective methods and processor could be used better
   • The bubble sort is is an algorithm that works by compairing two adjacent values in a list/data and swapping them so the lowest number is the first in the list/data (left to right) it compairs the first and the second.then the second and the third.etc.when it gets to the end of the list/data and then goes back to the start and keeps doing the swapping utill all the numbers are in the right order
   • Advantages
     • Not a lot of memory needed and easy to follow.
     • Few lines of code required for it to work

2. Quick sort

   • The quick sort is done by dividing the data into incrementally smaller and smaller subsets this is continued untill the data is completely sorted. it takes the first number in a sequence to use as a pivot and uses the pivot to look through all of the numbers placing the number in a group if it is smaller and then changing the the pivot if the number is larger
   • Advantages
     • More efficent than bubble sort and select sort. because it is faster
   • Disadvantages
     • the code is longer and is more difficult to understand than select sort and the bubble sort
     • Loses its effecency if the data is almost in order or is in reverse order

3. Selection sort

   • Selection sort= 2 parts sorted and unsorted.(sorted starts empty) the smallest number from thhe unsorted part is place in the right most edge of the sorted part after each pass.
   • Advantages include: easy to follow, few lines of code are needed, it is easy to follow
   • Disadvantages include: not overly effective for massive amounts of data

Bilder und Dateien der Mindmap