Heuristic in mathematical optimization and computer science is a technique designed for solving problems faster when classic methods are too slow or for finding an approximate solution when classic methods fail to find any exact solution. Heuristic takes a shortcut by trading optimality, completeness, accuracy, or precision for speed.
Found this article interesting? Follow Brightwhiz on Facebook, Twitter, and YouTube to read and watch more content we post.