Java program:

Convex Hull using Divide and Conquer Algorithm

A convex hull is the smallest convex polygon containing all the given points.

Input is an array of points specified by their x and y coordinates. The output is the convex hull of this set of points.

Examples:

Input : points[] = {(0, 0), (0, 4), (-4, 0), (5, 0), (0, -6), (1, 0)}; Output : (-4, 0), (5, 0), (0, -6), (0, 4)

use Divide and Conquer Algorithm

please explain the complexity and write good comments