Good day, Is there a way to identify in a logical way the fastest algorithm for solving a problem when programming or the area of ​​the solution? Of course it sounds as abstract as possible, but maybe at least indicate the direction?

Closed due to the fact that the question is too general for the participants Harry , Vadim Ovchinnikov , Mike , user194374, pavel Jan 11 '17 at 10:45 .

Please correct the question so that it describes the specific problem with sufficient detail to determine the appropriate answer. Do not ask a few questions at once. See “How to ask a good question?” For clarification. If the question can be reformulated according to the rules set out in the certificate , edit it .

  • five
    It seems you need to read about O. - KoVadim
  • one
    If such a method existed, the question P ?= NP would have been solved long ago. - Yaant
  • one
    Read the articles on "Estimating the complexity of algorithms" - Pavel
  • Here's a good question about stackoverflow on this topic: stackoverflow.com/questions/11032015/… - Pavel

0