README ¶ Insertion sort Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. Wikipedia Expand ▾ Collapse ▴ Documentation ¶ Index ¶ func Insertion(array []int64) Constants ¶ This section is empty. Variables ¶ This section is empty. Functions ¶ func Insertion ¶ func Insertion(array []int64) Insertion - sort by insertion Types ¶ This section is empty. Source Files ¶ View all Source files insertion.go Click to show internal directories. Click to hide internal directories.