M

Mr. Dubey • 51.67K Points
Coach

Q. Which of the following algorithms is the simplest?

(A) chan’s algorithm
(B) kirkpatrick-seidel algorithm
(C) gift wrapping algorithm
(D) jarvis algorithm
Correct : Option (A)

Explanation:
 chan’s algorithm is very practical for moderate sized problems whereas kirkpatrick-seidel algorithm is not. although, they both have the same running time. gift wrapping algorithm is a non-output sensitive algorithm and has a longer running time.

Share

Discusssion

Login to discuss.