Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def CountingSort(Array, Exp):
- N = len(Array)
- Output = [0] * (N)
- Count = [0] * (10)
- for i in range(0, N):
- Index = (Array[i]//Exp)
- Count[(Index)%10] += 1
- for i in range(1,10):
- Count[i] += Count[i-1]
- i = N-1
- while i>=0:
- Index = (Array[i]//Exp)
- Output[Count[(Index)%10] - 1] = Array[i]
- Count[(Index)%10] -= 1
- i -= 1
- i = 0
- for i in range(0, len(Array)):
- Array[i] = Output[i]
- def RadixSort(Array):
- Max = max(Array)
- Exp = 1
- while Max/Exp > 0:
- CountingSort(Array, Exp)
- Exp *= 10
- return Array
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement