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

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


    Given a set of n numbers, we wish to find the ‘I’ largest in sorted order using a comparisonbased algorithm. So we build a maxpriority queue from the numbers, and call EXTRACTMAX i times. What will be the time complexity of this algorithm ?

    Options :-

    1. O(n+ilogn)
    2. O(i+nlogn)
    3. O(n2logn)
    4. O(i2logn)
    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: Given a set of n numbers, we wish to find the ‘I’ largest in sorted order using a comparison‐based….
Your information:




Verify Yourself




Log in with your credentials

or    

Forgot your details?

Create Account