Skip to content

Commit 6f54693

Browse files
committed
solved: insertion_sort, try #2 -@iamserda
1 parent f998645 commit 6f54693

File tree

1 file changed

+11
-2
lines changed

1 file changed

+11
-2
lines changed

neetcodeio/algostructybeginners/Lv3-Sorting/insertion_sort2.py

Lines changed: 11 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -9,15 +9,24 @@ def insertionSort(self, arr: list) -> list:
99
for i in range(1, len(arr)):
1010
j = i - 1
1111
while j >= 0 and arr[j] > arr[j+1]:
12+
arr[j], arr[j + 1] = arr[j + 1], arr[j]
13+
j -= 1
14+
return arr
15+
1216

13-
1417
sol = Solution()
1518

1619
arr = [10, 1, 20, 2, 30, 3, 4, 40, 5]
17-
assert sol.insertionSort(arr) == [1, 2, 3, 4, 5, 10, 20, 30, 40]
20+
arr_ = sol.insertionSort(arr)
21+
print(arr_)
22+
assert arr_ == [1, 2, 3, 4, 5, 10, 20, 30, 40]
1823

1924
arr = [0, 4, 3, 2, 4, 0]
25+
arr_ = sol.insertionSort(arr)
26+
print(arr_)
2027
assert sol.insertionSort(arr) == [0, 0, 2, 3, 4, 4]
2128

2229
arr = [1, 3, 5, 4, 2]
30+
arr_ = sol.insertionSort(arr)
31+
print(arr_)
2332
assert sol.insertionSort(arr) == [1, 2, 3, 4, 5]

0 commit comments

Comments
 (0)