FilesExpand file tree

 v1

/

desc.json

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

13 lines (13 loc) · 664 Bytes

 v1

/

desc.json

Copy path

Top

File metadata and controls

• Code
• Blame

13 lines (13 loc) · 664 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

{

"Counting Sort": "Counting sort is a sorting algorithm for a collection of objects. Sorting is done according to the keys (small integers) of the objects. This works by counting the number of objects that have each distinct key value, and then using those counts to determine the positions of each key value.",

"Complexity": {

"time": "worst $O(n+k)$, best $O(n)$, average $O(n+k)$ where $n$ is the number of elements in the input array and $k$ is the range of the output",

"space": "worst $O(n+k)$"

},

"References": [

"<a href='https://en.wikipedia.org/wiki/Counting_sort'>Wikipedia</a>"

],

"files": {

"basic": "Counting sort"

}

}