Mapa mental
Sorting Algorithms

Contenido del mapa
Sorting Algorithms
Quick Sort
- Advantages
- More efficent, and therefore quicker, than bubble sort
- Explanation
- Identify a pivot, usually in the middle of the data set
- The data is re-ordered so that all data items smaller than the pivot are placed on one side, all points greater on another
- A similar sort is performed on the subset of data before the pivot and another sort on the subset after the pivot.
- Then the sort is performed on the subsequent sets, with each sort affecting smaler and smaller sets.
- A similar sort is performed on the subset of data before the pivot and another sort on the subset after the pivot.
- The data is re-ordered so that all data items smaller than the pivot are placed on one side, all points greater on another
- Identify a pivot, usually in the middle of the data set
- Disadvantages
- Looses efficency if sorting data that is almost in order or in reverse order
- The code to implement quicksort is more difficult to understand and implement than bubble sort
- Advantages
Selection sort
- Advantages
- Hardly any extra memory is needed to temporarily hold data during sorts
- Disadvantages
- Processor time is used inefficently, as some data items are examined multiple times.
- Takes a long time to sort large data sets, so unsuitable for big data
- Explanation
- The algorithm splits the list into 2 parts, sorted data (which is initially empty) and unsorted data
- During each pass, the smallest number from the unsorted part is placed on the right side of the sorted part
- The algorithm splits the list into 2 parts, sorted data (which is initially empty) and unsorted data
- Advantages
Bubble sort
- Advantages
- Hardly any extra memory is needed to temporarily hold data during sorts
- Very few lines of code required, so quick to code.
- Disadvantages
- Takes a long time to sort large data sets, so unsuitable for big data
- Processor time is used inefficently, as some data items are examined multiple times.
- Explanation
- It compares 2 adjacent data setsand swapping them if neccessary
- When it has worked through one end to another of the data ,it has completed a pass
- After each pass, the next biggest number is put into position at the end of the list
- The maximum number of passes required is n-1. (n is the number of values in the list)
- After each pass, the next biggest number is put into position at the end of the list
- When it has worked through one end to another of the data ,it has completed a pass
- It compares 2 adjacent data setsand swapping them if neccessary
- Advantages
Imágenes y archivos del mapa
Información
- Descripción
- GCSE (Problem solving) Computer Science Mapa Mental sobre Sorting Algorithms, creado por S F el 06/11/2015.
- Creado por
- S F
- Visitas
- 2
- Valoración











