Program sorts a list of numbers in ascending order using the Insertion Sort algorithm. Features a best case O(n) runtime and a worst case O(n2) runtime. Suitable for small and/or mostly sorted lists.
An Insertion Sort algorithm implemented in Python.
Program sorts a list of numbers in ascending order using the Insertion Sort algorithm. Features a best case O(n) runtime and a worst case O(n2) runtime. Suitable for small and/or mostly sorted lists.
Log in or sign up for Devpost to join the conversation.