Update 033-insertion-sort-python.md

underscoremissa · Oct 12, 2021 · fb8a8a9 · fb8a8a9
1 parent 4821e46
commit fb8a8a9
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/python/033-insertion-sort-python.md b/python/033-insertion-sort-python.md
@@ -58,6 +58,6 @@ As you can see, it closely follows the pseudocode, with some minimal code saving
 
 ## Runtime
 
-As mentioned, the average runtime for this algorithm is `O(n^2)`. The best case is an array that is already sorted with a runtime of `O(n)` as the current element in the array will only be compared once with a prior element. The worst case is an array that is sorted in reverse as each new element will need to be compared (and swapped) to every prior element to the beginning of the array.
+As mentioned, the average runtime for this algorithm is `O(n^2)`. The best case is an array that is already sorted with a runtime of `O(n)` as the current element in the array will only be compared once with a prior element. The worst case is an array that is sorted in reverse as each new element will need to be compared (and swapped) with every prior element to the beginning of the array.
 
 Thanks for reading, any comment or feedback is most welcome!