Q.

To which type of problems does quick hull belong to?

A. numerical problems
B. computational geometry
C. graph problems
D. string problems
Answer» B. computational geometry
Explanation: quick hull problem and closest pair algorithms are some of the examples of computational problems.
627
0
Do you find this helpful?
1

Discussion

No comments yet