>>12861797NP-Hard is better described as problems that require pivot points to be identified via linear priority.
So, basically, the algorithm you are talking about is equivalent to: this comes after that * n UNTIL done.
If yours is good at solving those sort of problems the chances are your powers of observation is essentially able to identify where a slice or pivot has to be in order for the problem to be solved.
