-
Notifications
You must be signed in to change notification settings - Fork 367
Expand file tree
/
Copy pathbingo_sort.py
More file actions
37 lines (27 loc) · 731 Bytes
/
bingo_sort.py
File metadata and controls
37 lines (27 loc) · 731 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
def bingoSort(arr):
min_val = min(arr)
max_val = max(arr)
flags = [0] * (max_val - min_val + 1)
for num in arr:
flags[num - min_val] = 1
sorted_arr = []
for i in range(len(flags)):
if flags[i]:
sorted_arr.append(i + min_val)
return sorted_arr
def main():
n = int(input("Enter the length of the array: "))
a = []
print("Enter the elements of the array:")
for _ in range(n):
num = int(input())
a.append(num)
print("Original array:")
for num in a:
print(num, end=" ")
sorted_arr = bingoSort(a)
print("\nSorted array:")
for num in sorted_arr:
print(num, end=" ")
if __name__ == "__main__":
main()