Algorithms
- Created by: yagneshganatra
- Created on: 16-03-18 10:28
View mindmap
- Algorithms
- Sorts
- Searchs
- Insertion sort
- 2. It then moves the element to its final position
- 1. Works by repeatedly finding the next smallest or largest element in the array.
- Sorts
- Advantages
- Very simple
- Exhibits a good performance when dealing with a small list
- Required space is minimal to carry out the sort
- Disadvantages
- Struggles to deal with large lists
- Insertion sort
Comments
No comments have yet been made