GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — AlgorithmVisualizer/algorithm/sorting/quick/desc.json at master · allensh929/AlgorithmVisualizer Expand file tree/ Copy pathdesc.jsonMore file actions 13 lines (13 loc) · 705 Bytes / Copy pathdesc.jsonFile metadata and controls13 lines (13 loc) · 705 Bytes 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" } } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |