mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-07-19 10:48:58 +08:00
237df47a31
Python implementation of merge sort algorithm. Takes an average of 0.6 microseconds to sort a list of length 1000 items. Best Case Scenario : O(n) Worst Case Scenario : O(n)
21 lines
500 B
Python
21 lines
500 B
Python
'''
|
|
Python implementation of merge sort algorithm.
|
|
Takes an average of 0.6 microseconds to sort a list of length 1000 items.
|
|
Best Case Scenario : O(n)
|
|
Worst Case Scenario : O(n)
|
|
'''
|
|
def merge_sort(LIST):
|
|
start = []
|
|
end = []
|
|
a = LIST[0]
|
|
b = LIST[-1]
|
|
while (LIST.index(a) == LIST.index(b) and len(LIST) <=2):
|
|
a = min(LIST)
|
|
b = max(LIST)
|
|
start.append(a)
|
|
end.append(b)
|
|
LIST.remove(a)
|
|
LIST.remove(b)
|
|
end.reverse()
|
|
return start + end
|