forked from columbia-ossd/python-utils-g1
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathutils.py
More file actions
126 lines (106 loc) · 2.48 KB
/
Copy pathutils.py
File metadata and controls
126 lines (106 loc) · 2.48 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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
"""
A collection of utilities for working with lists.
"""
"""
Finds the largest value in the list.
"""
def largest(lst):
idx = find_largest(lst, 0)
return lst[idx]
# max = lst[0]
# for i in range(1, len(lst)):
# if lst[i] > max:
# max = lst[i]
# return max
"""
Sorts the list according to the "natural order" of the values.
Sorts ascending if "asc" is True, and descending if it is False.
"""
def sort(lst, asc):
for i in range(len(lst)):
if asc:
idx = findSmallest(lst, i)
else:
idx = findLargest(lst, i)
swap(lst, i, idx)
return lst
"""
From repo instructions: "Add an “is_sorted” function that takes a list and returns True if it is sorted in non-descending order and False otherwise"
"""
def is_sorted(lst):
for i in range(1, len(lst)):
if lst[i] < lst[i - 1]:
return False
return True
"""
Helper function to find the largest element in the list starting
at index "start"
"""
def findLargest(lst, start):
max = lst[start]
idx = start
for i in range(start + 1, len(lst)):
if lst[i] > max:
max = lst[i]
idx = i
return idx
"""
Helper function to find the smallest element in the list starting
at index "start"
"""
def findSmallest(lst, start):
max = lst[start]
idx = start
for i in range(start + 1, len(lst)):
if lst[i] < max:
max = lst[i]
idx = i
return idx
"""
Helper function to swap two values in a list
"""
def swap(lst, a, b):
tmp = lst[a]
lst[a] = lst[b]
lst[b] = tmp
"""
Function to determine whether a list contains a target value
using binary search
"""
def search(lst, target):
low = 0
high = len(lst) - 1
found = False
while high >= low and not found:
mid = (high + low) // 2
if (lst[mid] == target):
found = True
elif (lst[mid] > target):
high = mid - 1
else:
low = mid + 1
return found
"""
Function to get the average from a list of numerical values
"""
def average(lst):
if not lst:
return 0
total = 0
for i in lst:
if isinstance (i, (int, float)):
total += i
return total / len(lst)
"""
Some test cases for the sort and search functions
"""
def main():
# a = [5, 7, 1, 8, 3]
a = [4, 6, 2]
print(largest(a))
sort(a, True)
print(a)
print(search(a, 7))
print(average(a))
if __name__ == "__main__":
main()