Graham Scan Algorithm
<p>It can be visualized as a rubber band that one could wrap around a set of points such that no point could fall its boundary.</p>
<h1>Algorithm</h1>
<p><strong>Step 1: </strong>Select the bottom-most points (if there is a tie then pick the point at the extreme left). let it be Po(Xo,Yo).</p>
<p><strong>Step 2: </strong>Sort the points P according to the angle made by the lines y=Yo and the line joining the point P and Po. If the angle is the same then the distance between P and Po will be the criteria.</p>
<p><a href="https://medium.com/@madhavyadav4595/graham-scan-algorithm-5c287ef00ecd"><strong>Click Here</strong></a></p>