hyunkookim 님의 블로그

Sorting: Merge Sort   # Implementation of MergeSortdef mergeSort(arr, s, e): if e - s + 1  1. Split Processhttps://youtu.be/dsIzDKUY-uU 2. mergeSort() using Recursive Callhttps://youtu.be/qsChtOXqO1U 3. merge() using Three Pointershttps://youtu.be/RXbe0JWUKao StableTime: O(n log n)Space: O(n)

Sorting: Insertion Sort  https://youtu.be/bPlYH--OYNc def insertionSort(arr): # Traverse through 1 to len(arr) for i in range(1, len(arr)): j = i - 1 while j >= 0 and arr[j + 1]  Stableity: Stable 안정Time Complexity:Best: O(n)Worst: O(n^2)Average: O(n^2)Space Complexity: O(1)