-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcounting_sort.py
More file actions
46 lines (39 loc) · 1.09 KB
/
counting_sort.py
File metadata and controls
46 lines (39 loc) · 1.09 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
import unittest
def counting_sort(arr):
def _counting_sort(list, smallest, largest):
n_bins = largest - smallest + 1
bins = [0] * n_bins
for i in list:
bins[i - smallest] += 1
return [i + smallest for i, n in enumerate(bins) for _ in range(n)]
result = _counting_sort(arr, min(arr), max(arr))
return result
class TestCountingSort(unittest.TestCase):
def test(self):
arr = counting_sort([5, 3, 2, 1, 4])
self.assertEqual(
arr,
[1, 2, 3, 4, 5]
)
arr = counting_sort([-1, -10, 2, 4, 1])
self.assertEqual(
arr,
[-10, -1, 1, 2, 4]
)
arr = counting_sort([1, -1, 5, 2, 4, 2])
self.assertEqual(
arr,
[-1, 1, 2, 2, 4, 5]
)
arr = counting_sort([5, 2])
self.assertEqual(
arr,
[2, 5]
)
arr = counting_sort([-1, -1, 2, 5, 4, 2])
self.assertEqual(
arr,
[-1, -1, 2, 2, 4, 5]
)
if __name__ == '__main__':
unittest.TestCase()