Grammar

kibebr · web-flow · commit 26210aed49fc · 2019-10-07T05:54:37.000-04:00
it's -&gt; its
diff --git a/algorithms/sorting/insertion_sort.py b/algorithms/sorting/insertion_sort.py
@@ -1,6 +1,6 @@
 """
 High Level Description:
-For every element in the given list, find it's correct index by iterating
+For every element in the given list, find its correct index by iterating
 backwards and finding a slot. This forms a sorted array.
 
 Time Complexity:
@@ -14,4 +14,4 @@ def insertion_sort(lst):
         while(j > 0 and lst[i] < lst[j]):
             j -= 1
         lst[j], lst[i] = lst[i], lst[j]
-    return lst
+    return lst
