Merge sort follows T(n)=2T(n/2)+O(n), because it sorts two halves and merges them in linear work.
Read the related guide · · Bookmark this unique URL with Ctrl/Cmd+D.
A recurrence describes an algorithm's cost using the costs of smaller input sizes plus the work done at the current level. Experiment with a small example and see each step update.
Merge sort follows T(n)=2T(n/2)+O(n), because it sorts two halves and merges them in linear work.
Read the related guide · · Bookmark this unique URL with Ctrl/Cmd+D.