Created
March 3, 2014 23:41
-
-
Save globby/9337071 to your computer and use it in GitHub Desktop.
The Insertion Sort algorithm
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def insertion(a): | |
| if len(a) < 2: return | |
| for i in range(len(a)): | |
| k = i | |
| while k > 1 and a[k] < a[k-1]: | |
| a[k], a[k-1] = a[k-1], a[k] | |
| k -= 1 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment