worst case means the worst case. For the first time I heard this expression at the university, when I studied the algorithms that are used to find the solution to a problem of discrete mathematics, such as optimization problems on graphs (similar problems to solve every navigation system dozens of times per minute to find the right way). The worst case is when, among all the possibilities, the algorithm to find a particular solution, choose the longest path computation and laborious. The worst case determines whether an algorithm is good or not. Or whether an issue is negotiable or not (not negotiable means solved, a problem can theoretically be solved but require computing resources too high to be manageable). Why talk about
Worst Case? Why the Worst Case algorithms and problems of discrete mathematics is the reality of the Black Swan. It 's the thing that goes wrong in the worst way (Murphy's law for short), but above that was not anticipated. Learning algorithms require to think not only about the problem and ways of solution but also on the amount of work that requires a problem and this in turn becomes a problem. So much so that we need a theory the so-called theory of computational complexity .
In fact, this theory has assumed importance with the computer and the need to solve problems with mathematical algorithms. But we wanted to solve a problem and there we found two in a more abstract order that says how much time and resources I will need to solve the problem? And all this even before we solve a problem.
This question has no simple answers but most of all is extended to all the problems that are solvable with an algorithm or a sequence of operations.
In addition we found that to understand how a problem can be complicated at least we groped to find his swan black. But to hit the black swan changes our perspective and perhaps the problem does not concern us more in the same terms as before.
Mah .. things are always more complex than they seem.
0 comments:
Post a Comment