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.

>>13

O(0.5n)

DAT WUD BE O(n)

O(2)
O(7)

N DAT WUD BE O(1)

AND WAT DA FUCK ARE U TALKIN ABOUT? TIME, SPACE? WORST CASE, BEST CASE?

GET DA FUCK OUTTA MY THRED N GO PLAY WITH UR HTML5, YA FUCKIN BUZZWORDIN' BUSINESSBOI RETOID