M

Mr. Dubey • 100.69K Points
Coach

Q. To which type of problems does quick hull belong to?

  • (A) numerical problems
  • (B) computational geometry
  • (C) graph problems
  • (D) string problems
Share

Explanation by: Mr. Dubey
quick hull problem and closest pair algorithms are some of the examples of computational problems.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.


Question analytics