Which of the following algorithms is the simplest?
|C.||gift wrapping algorithm|
|Answer» A. chan’s algorithm|
|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.|
Login to Continue
It will take less than 2 minutes