Linear Time Sorting Algorithm

'''
O(n) sorting algorithm for sorting distinct positive integers
'''

array = [3,7,2,8,5,1,0]

#O(array) Time
n = max(array) 

sortedArray = [None] * (n + 1)

#O(array) Time
for i in array:
    sortedArray[i] = i

condensedSortedArray = []

#O(n) Time
for i in sortedArray:
    if i is not None:
        condensedSortedArray.append(i)

print(condensedSortedArray)