Editing Gift wrapping algorithm (section)

==Complexity==
The inner loop checks every point in the set ''S'', and the outer loop repeats for each point on the hull.  Hence the total run time is <math>O(nh)</math>.  The run time depends on the size of the output, so Jarvis's march is an [[output-sensitive algorithm]].

However, because the running time depends [[linear time|linearly]] on the number of hull vertices, it is only faster than  <math>O(n \log n)</math> algorithms such as [[Graham scan]] when the number ''h'' of hull vertices is smaller than log&nbsp;''n''. [[Chan's algorithm]], another convex hull algorithm, combines the logarithmic dependence of Graham scan with the output sensitivity of the gift wrapping algorithm, achieving an asymptotic running time  <math>O(n \log h)</math>  that improves on both Graham scan and gift wrapping.