What I know from here, http://ift.tt/1BT85pY , is that an algorithm.. "is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some nonnegative integer k, where n is the complexity of the input."
Can some of you offer examples involving common data structures to explain polynomial time? I've looked it up but the available information is scarce.
Aucun commentaire:
Enregistrer un commentaire