# Convex hull algorithm divide and conquer strategy

We can use Divide and Conquer strategy to solve the convex-hull problem. The T(n) of sequential algorithm to solve this problem is O(n log n), whereas our parallel algorithm. as we will see uses an optimal number of operations, so its T(n) is O(log2 n) and its W(n) is O(n log n). Remark: Before proceeding to the algorithm, for now consider. In this article, I talk about computing convex hull using the divide and conquer technique. The divide and conquer algorithm takes O(nlogn) time to run. In this article, I talk about computing convex hull using the divide and conquer technique. The divide and conquer algorithm takes O(nlogn) time to MindWalkBand.com: Bibek Subedi. 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. Convex Hull | Set 1 (Jarvis’s Algorithm or Wrapping).

# Convex hull algorithm divide and conquer strategy

• 