green flag to reset and update length turbo mode is recommended for long lists, shift press green flag
inefficient but simple sorting algorithm unstable not adaptive space - O(1) inplace time compl - O(n^2) let x be 0 and make it increase with each iteration find the smallest item after x and put it at x eg: [4, 7, 2, 6, 5] [4, 7, 2, 6, 5] _^___* [2, 7, 4, 6, 5] ___^_* [2, 4, 7, 6, 5] _____^___* [2, 4, 5, 6, 7] _____^___* [2, 4, 5, 6, 7] ______^*
