forked from OmkarPathak/pygorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathinsertion_sort.py
More file actions
47 lines (38 loc) · 946 Bytes
/
insertion_sort.py
File metadata and controls
47 lines (38 loc) · 946 Bytes
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
"""
Author: OMKAR PATHAK
Created On: 31st July 2017
- Best O(n)
- Average O(n^2)
- Worst O(n^2)
"""
import inspect
def sort(_list):
"""
Insertion sort algorithm
:param _list: list or values to sort
:return: sort values
"""
for i in range(1, len(_list)):
current_number = _list[i]
for j in range(i - 1, -1, -1):
if _list[j] > current_number:
_list[j], _list[j + 1] = _list[j + 1], _list[j]
else:
_list[j + 1] = current_number
break
return _list
# TODO: Are these necessary?
def time_complexities():
"""
Return information on functions
time complexity
:return: string
"""
return "Best Case: O(n), Average Case: O(n ^ 2), Worst Case: O(n ^ 2)"
def get_code():
"""
easily retrieve the source code
of the sort function
:return: source code
"""
return inspect.getsource(sort)