Travelling Salesman Problem

I have found a solution. By modeling the problem as a graph represented with an adjacency matrix, I can find the optimum path with only elementary row reduction and matrix multiplication. I will be keeping my discovery proprietary for now to continue searching for bugs, but please sing my praises and congratulate me on this world-changing discovery.

>>4
No, stupid, exactly O(2n). You're the type of retard who would call O(n³+n²+log₂(n)+n) the same as O(n³) and then wonder why your programs are so much fucking slower than mine are.