This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 1 year, 11 months ago.

  • Author
    Posts
  • #1440076 Reply
     EduGorilla 
    Keymaster
    Select Question Language :


    Although merge sort runs in worst-case time and insertion sort runs in O(n2) worst-case time, the constant factors in insertion sort can make it faster in practice for small problem sizes on many machines. Thus, it makes sense to coarsen the leaves of the recursion by using insertion sort within merge sort when subproblems become sufficiently small. Consider a modification to merge sort in which n/k sublists of length k are sorted using insertion sort and then merged using the standard merging mechanism. What is the worst case time complexity of this modified merge sort ?

    Options :-

    1. O(nlogk)
    2. O(klogn)
    3. O(nlogn)
    4. O(nk)
    Post your Training /Course Enquiry
    Are You looking institutes / coaching center for
    • IIT-JEE, NEET, CAT
    • Bank PO, SSC, Railways
    • Study Abroad
    Select your Training / Study category
Reply To: Although merge sort runs in worst-case time and insertion sort runs in O(n2) worst-case time, the c….
Your information:




Verify Yourself




Log in with your credentials

or    

Forgot your details?

Create Account