Design and Analysis of Algorithms - Old Questions
9. Define the convex hull in 2D. Write the Grahm’s scan algorithm and its correctness for computing the convex hull of points in 2D and analyze its time complexity.
8 marks
|
Asked in 2074