Radix Sort: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= * Sorting Algorithms =Overview= <font color=darkgray>If there are n integers to sort, each integer has d...") |
|||
| (One intermediate revision by the same user not shown) | |||
| Line 5: | Line 5: | ||
=Overview= | =Overview= | ||
<font color=darkgray>If there are n integers to sort, each integer has d digits, and each digit can take up to k possible values, then radix sort can sort the numbers in Θ(d(n + k)) time.</font> | <font color=darkgray> | ||
[[CLRS]] page 197. | |||
If there are n integers to sort, each integer has d digits, and each digit can take up to k possible values, then radix sort can sort the numbers in Θ(d(n + k)) time.</font> | |||
{| | |||
| [[Algorithm_Complexity#Worst-case_Running_Time|Worst-case time]] || Θ(d(n + k)) | |||
|- | |||
| [[Algorithm_Complexity#Average-case_Running_Time|Average-case time]] || Θ(d(n + k)) | |||
|- | |||
| [[Algorithm_Complexity#Best-case_Running_Time|Best-case time]] || | |||
|} | |||
Latest revision as of 01:18, 10 August 2018
Internal
Overview
CLRS page 197.
If there are n integers to sort, each integer has d digits, and each digit can take up to k possible values, then radix sort can sort the numbers in Θ(d(n + k)) time.
| Worst-case time | Θ(d(n + k)) |
| Average-case time | Θ(d(n + k)) |
| Best-case time |