What is the insertion sort algorithm? — for (i = 0; i < n; ++i) { j = i; while (j > 0 && a[j - 1] > a[j]) { swap(a, j, j - 1); j -= 1; } }

This flashcard deck made by jwasham contains knowledge about google interview. For more details, please follow https://github.com/jwasham/google-interview-university