Sorting algorithms 2
- Created by: Tomiwaq
- Created on: 19-04-19 14:36
View mindmap
- Sorting algorithms
- Merge sort
- 1) Split the list in half into sub-lists
- 2) Keep repeating 1) until all lists only contain 1 item
- 3) Merge pairs of sub-lists so that each sub-list has double. Sort them in order now
- 4) Repeat 3) until all sub-lists have merged
- Advantages to merge sort
- It is quicker than bubble and insertion sorts for large lists
- It has a very consistent running time
- Disadvantages to merge sort
- It's slower than other algorithms for small lists
- Even if the list is sorted, it still goes through the whole process
- Uses more memory than other sorting algorithms
- Merge sort
Comments
No comments have yet been made