# 35.3 MSD Radix Sort

Suppose we sort by topmost digit, then middle digit, then rightmost digit. Will we arrive at the correct result?

No, this will result in sorting the array by right most digit only as we are not saving the topmost and middle digit.

Notice first we sorted by leftmost digit. Then we grouped the data by the leftmost digit, so one group would start with a's, then the next group would start with b's, and so on and so forth. Then within our subgroups we would order by middle digit, and create newer subgroups. And finally we would break this up into further subgroups until we have all individual subproblems. This final result would be sorted. ### Runtimes Best Case. * We finish in one counting sort pass, looking only at the top digit: $$\Theta(N+R)$$ Worst Case. * We have to look at every character, degenerating to LSD sort: $$\Theta(WN+WR)$$ ### Summary of Runtimes

--- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://cs61b-2.gitbook.io/cs61b-textbook-2025/35.-radix-sorts/35.3-msd-radix-sort.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.