Merge Sort Performance

As we have seen, Merge Sort is O(n · log(n)). Despite requiring extra storage, Merge Sort has a number of advantages:

Contents    Page-10    Prev    Next    Page+10    Index