forked from OmkarPathak/pygorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmerge_sort.py
More file actions
69 lines (56 loc) · 1.3 KB
/
merge_sort.py
File metadata and controls
69 lines (56 loc) · 1.3 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
"""
Author: OMKAR PATHAK
Created On: 31st July 2017
- Best = Average = Worst = O(n log(n))
"""
import inspect
def merge(a, b):
"""
Function to merge
two arrays / separated lists
:param a: Array 1
:param b: Array 2
:return: merged arrays
"""
c = []
while len(a) != 0 and len(b) != 0:
if a[0] < b[0]:
c.append(a[0])
a.remove(a[0])
else:
c.append(b[0])
b.remove(b[0])
if len(a) == 0:
c += b
else:
c += a
return c
def sort(_list):
"""
Function to sort an array
using merge sort algorithm
:param _list: list of values to sort
:return: sorted
"""
if len(_list) == 0 or len(_list) == 1:
return _list
else:
middle = len(_list)//2
a = sort(_list[:middle])
b = sort(_list[middle:])
return merge(a, b)
# TODO: Are these necessary?
def time_complexities():
"""
Return information on functions
time complexity
:return: string
"""
return "Best Case: O(nlogn), Average Case: O(nlogn), Worst Case: O(nlogn)"
def get_code():
"""
easily retrieve the source code
of the sort function
:return: source code
"""
return inspect.getsource(sort) + "\n" + inspect.getsource(merge)