Convex Hull | Set 1 (Jarvis’s Algorithm or Wrapping) – Geometric Algorithms – The idea of Jarvis’s Algorithm is simple, we start from the leftmost point.
convex hull algorithm
2 Articles
2
Find the closest pair from two sorted arrays – Searching and Sorting – Given two sorted arrays and a number x, find the pair whose sum is closest to x and the pair has an element from each array.