Is it possible to make a script that would sort through an array of points and find a (one, not necessarily the optimal) solution to the Traveling Salesman Problem, without intersections?

Input should be an array where points are stored in no particular order.
Output would be a new array where the points have been sorted.