Answer to Question #191443 in Algorithms for kerthik

Question

⦁ Write the algorithm for the convex hull problem using the divide and conquer technique and its time complexity.

Answer 1

In short, we take the points into two sets, left and right, for each set we find the shell and complement it to the shell (a straight line oblique from the top and a straight line tangent from the bottom).

complexity n * log n.

if you need more details, you can see this:

https://iq.opengenus.org/divide-and-conquer-convex-hull/#:~:text=The%20key%20idea%20is%20that,results%20to%20a%20complete%20solution.