forked from OmkarPathak/pygorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathshell_sort.py
More file actions
50 lines (40 loc) · 1.01 KB
/
shell_sort.py
File metadata and controls
50 lines (40 loc) · 1.01 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
"""
Author: OMKAR PATHAK
Created On: 31st July 2017
- Best Case O(n log n)
- Average Case O(depends on gap sequence)
- Worst Case O(n^2)
"""
import inspect
def sort(_list):
"""
Shell sort algorithm
:param _list: list of integers to sort
:return: sorted list
"""
gap = len(_list) // 2
while gap > 0:
for i in range(gap, len(_list)):
current_item = _list[i]
j = i
while j >= gap and _list[j - gap] > current_item:
_list[j] = _list[j - gap]
j -= gap
_list[j] = current_item
gap //= 2
return _list
# TODO: Are these necessary?
def time_complexities():
"""
Return information on functions
time complexity
:return: string
"""
return "Best Case: O(nlogn), Average Case: O(depends on gap sequence), Worst Case: O(n ^ 2)"
def get_code():
"""
easily retrieve the source code
of the sort function
:return: source code
"""
return inspect.getsource(sort)