insertion sort Algorithm
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time.
However, insertion sort provides several advantages:
Simple implementation: Jon Bentley shows a three-line c version, and a five-line optimized version
Efficient for (quite) small data sets, much like other quadratic sorting algorithmsAdaptive, i.e., efficient for data sets that are already substantially sorted: the time complexity is O(kn) when each component in the input is no more than K places away from its sorted position
Stable; i.e., makes not change the relative order of components with equal keys
package main
/*
* Insertion sort - https://en.wikipedia.org/wiki/Insertion_sort
*/
func InsertionSort(arr []int) {
var i, j int
for i = 1; i < len(arr); i++ {
for j = 0; j < i; j++ {
if arr[j] > arr[i] {
arr[i], arr[j] = arr[j], arr[i]
}
}
}
}