Question

the quickhull algorithm has resemblance to which of the following?
select one
a. quicksort
b. none of these
c. mergesort
d. binary tree

Explanation:

The Quickhull algorithm is a divide - and - conquer algorithm used for computing the convex hull of a finite set of points in the plane. Quicksort is also a divide - and - conquer algorithm. In quicksort, we select a pivot element and partition the array around the pivot. Similarly, in Quickhull, we divide the set of points based on a line (analogous to the pivot in quicksort) and recursively find the convex hull for the subsets. Mergesort is also a divide - and - conquer algorithm but its merging step is different from the partitioning in Quickhull. A binary tree is a data structure and not an algorithm with a similar divide - and - conquer strategy as Quickhull in terms of the problem - solving approach (partitioning and recursive processing of subsets).

Answer:

A. Quicksort