- 07/13/2019 at 12:55 am #1431025EduGorillaKeymasterSelect 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.
Post your Training /Course EnquiryAre You looking institutes / coaching center for
- IIT-JEE, NEET, CAT
- Bank PO, SSC, Railways
- Study Abroad