How close to optimal would a Traveling Salesman solution of "Check the distance to all non-visited points, then go to the nearest one" be?

Question

While obviously not optimal, I've usually found that such an "algorithm" is pretty close to the true shortest possible path, and is obviously runnable in polynomial time, with an O equal to your sorting algorithm