Sorting algorithms

Sorting algorithms

1. Bubble sort

   • Explained
     • This i a simple algorithm. It compares two adjacent values and then swapps them if they are needed to swap. Then it compares the first number with all the other integars in the list. It will go through the list. This is called a pass an the algortihm casn pass many times.
   • Advantages
     • Bubble sort is easy to programme to code and there extra data is not needed to store it
   • Disadvantages
     • The code dosent function to its gratest potential when large amounts of data is used. The programme also takes a long time to process and over looks the data multiple times

2. Quicksort

   • advantages
     • This is more efficent which means its fatser that the bubble sort
   • Disadvantages
     • The algorithm loses it efficency when the integars in the list are almost in order the code i more complicated and difficult to underastand
   • Explanation
     • This algorithm is very efficent and good for solving large amounts of Data. It works by choosing a pivott and finding the numbers smaller and larger and then moves them to ther correct space

3. Selection sort

   • Explanation
     • This algoritm splits a collection into two parts. A sorted part and an unsorted part. In the firsat pass the smallest number in the unsorted part goes straight to number 1 space in the sorted section.
   • advantages
     • It has the same advantages as bubblesort
   • Disadvantages
     • The sam disadvantages as bubblesort

Bilder und Dateien der Mindmap