# Difference between revisions of "TADM2E 4.24"

From Algorithm Wiki

(Recovering wiki) |
(Recovering wiki) |
||

Line 1: | Line 1: | ||

− | It's not clear to me if the first | + | It's not clear to me if the first <math>n - \sqrt n</math> element being sorted means that the remaining <math>\sqrt n</math> elements are all bigger or not, but let's suppose they are not, since that's more general. |

− | First sort the remaining | + | First sort the remaining <math>\sqrt n</math> elements in <math>O(\sqrt n \log n)</math> time. After that we can do a simple merge step to merge the two sorted arrays in <math>O(n)</math> time. Since <math>\sqrt n</math> dominates <math>\log n</math> we can come to the conclusion that the total running time of this algorithm is: <math>O(\sqrt n \log n + n) = O(\sqrt n \sqrt n + n) = O(n + n) = O(n)</math> |

## Revision as of 18:23, 11 September 2014

It's not clear to me if the first $ n - \sqrt n $ element being sorted means that the remaining $ \sqrt n $ elements are all bigger or not, but let's suppose they are not, since that's more general.

First sort the remaining $ \sqrt n $ elements in $ O(\sqrt n \log n) $ time. After that we can do a simple merge step to merge the two sorted arrays in $ O(n) $ time. Since $ \sqrt n $ dominates $ \log n $ we can come to the conclusion that the total running time of this algorithm is: $ O(\sqrt n \log n + n) = O(\sqrt n \sqrt n + n) = O(n + n) = O(n) $