Divide-and-Conquer Algorithm | Definition, Approach & Example

Consider a divide and conquer algorithm which takes an input set P with |P| = n and divides it into two pieces, P1 and P2. The two pieces are such that P1 ∩ P2 = φ, P1 ∪ P2 = P, and |P1| ≥ (n/3) and |P2| ≥ (n/3). The algorithm recursively solves the problem on P1 and P2 and merges the solution in O(n^1.5) time. In the base case, when the problem is of size 1, the algorithm returns the correct solution in 1 step. Show that the running time of this algorithm is O(n^1.5). You will still re