![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
Which of the following algorithms is the simplest? |
A. | chan’s algorithm |
B. | kirkpatrick-seidel algorithm |
C. | gift wrapping algorithm |
D. | jarvis 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. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet