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

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


    Consider a problem which is solved by developing algorithm for it using Divide and Conquer technique. In the algorithm , the divide time is equal to the number of inputs which divides our problem into parts of size n/10 and 7n/10 respectively. There are two recursive function calls inside the algorithm. The first one conquers the first part and the second function call conquers the second part. There is no need to combine the sub problems. Find the time complexity of this algorithm.

    Options :-

    1. O(n2)
    2. O(n2logn)
    3. O(nlogn)
    4. O(n)
    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: Consider a problem which is solved by developing algorithm for it using Divide and Conquer technique….
Your information:




Verify Yourself




Log in with your credentials

or    

Forgot your details?

Create Account