Insertion Sorts
These are sorting algorithms that typically rely on a separate data structure to do the sorting before placing the elements back into their original array.
Insertion sort list
Here is a list of all the Insertion Sorts that I’ve analysed:
Cube Sort
Cube Sort is a sorting algorithm that uses a binary search cube to store the data being used in a 4-dimensional array.
Gnome Sort
Gnome Sort is a sorting algorithm that replicates the functionality of a Turing Machine - its main pointer can move only one step at a time.
Insertion Sort
Insertion Sort is a simple sorting algorithm that moves elements leftwards until they find their position in a sorted sub-list.
Library Sort
Library Sort is a sorting algorithm that uses a binary search on each element to insert it into a sorted sub-array.
Patience Sort
Patience Sort is a sorting algorithm that uses the Piles data structure to sort an array of items like a game of solitaire.
Shell Sort
Shell Sort is a sorting algorithm that sorts similarly to Insertion sort, but allows items to jump more than one space at a time.
