scratch/data_structures_and_algorithms/top-scores.py


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

from collections import deque

# list:
# array:
# vector:
# bit-{array,vector}:


def sort(xs, highest):
    v = [0] * (highest + 1)
    result = deque()

    for x in xs:
        v[x] += 1

    for i, x in enumerate(v):
        if x > 0:
            result.appendleft(i)

    return list(result)


assert sort([37, 89, 41, 100, 65, 91, 53],
            100) == [100, 91, 89, 65, 53, 41, 37]
print("Tests pass!")