This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 2 years, 6 months ago.

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


    Mr Jack is a professor in MIT university. He has marks of all the students of his class. He wants to sort the students according to their marks. So he decided to use Merge Sort for this operation. But by mistake he used linked list as data structure instead of using array. What will be the new time complexity of merge sort ?

    Options :-

    1. O(n2)
    2. O(nlogn)
    3. O(n2logn)
    4. O(nlog2n)
    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: Mr Jack is a professor in MIT university. He has marks of all the students of his class. He wants to….
Your information:




Verify Yourself




Log in with your credentials

or    

Forgot your details?

Create Account