What are the different types of sort algorithms?
Bubble sort
Insertion sort
Merge sort
How does a bubble sort work?
It is quite simple in how in works:
It repeatedly steps though a list of data, comparing each pair of data it comes across and swaps their placements if their order is wrong
How does an insertion sort work?
It is quite simple in how it works, but is more efficient than a bubble sort:
It steps through a list of data and for each item it finds it compares it with all the previous items of data. If it is smaller than a previous piece of data, it is swapped and the next digit back is compared with the same data value
How does a merge sort work?
It is the most complex sort, but also the quickest: