We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent c23335f commit 3ba5bd1Copy full SHA for 3ba5bd1
counting_sort.py
@@ -1,11 +1,12 @@
1
def counting_sort(arr):
2
- """Couting_sort
3
- Sorting a array which has no element greater than k
4
- Creating a new temp_arr,where temp_arr[i] contain the number of
5
- element less than or equal to i in the arr
6
- Then placing the number i into a correct position in the result_arr
7
- return the result_arr
8
- Complexity: 0(n)
+ """
+ Couting_sort
+ Sorting a array which has no element greater than k
+ Creating a new temp_arr,where temp_arr[i] contain the number of
+ element less than or equal to i in the arr
+ Then placing the number i into a correct position in the result_arr
+ return the result_arr
9
+ Complexity: 0(n)
10
"""
11
12
m = min(arr)
0 commit comments