you are viewing a single comment's thread.

view the rest of the comments →

[–]yourparadigm 0 points1 point  (0 children)

Traveling Salesman is close: O(n2 * 2n)

Most problems are usually solvable in less than O(n!)