FilesExpand file tree

 master

/

desc.json

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

13 lines (13 loc) · 705 Bytes

 master

/

desc.json

Copy path

Top

File metadata and controls

• Code
• Blame

13 lines (13 loc) · 705 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

{

"Quicksort": "Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. Developed by Tony Hoare in 1959, with his work published in 1961, it is still a commonly used algorithm for sorting. When implemented well, it can be about two or three times faster than its main competitors, merge sort and heapsort.",

"Complexity": {

"time": "worst $O(n^2)$, best $O(n \\, log \\, n)$, average $O(n \\, log \\, n)$",

"space": "worst $O(n)$ auxiliary"

},

"References": [

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

],

"files": {

"basic": "Quicksort"

}

}