Given a circular array, rearrange the array so that the maximum absolute difference between adjacent elements among all elements is minimum. Can anyone help me with this?
Sounds like that's equivalent to the travelling salesman problem.
In your case, each element in the array is a city, and the distance between two cities is the difference between each element.
Here's a paper on a fast solution to TSP that I pulled off arxiv:
Here's a fast TSP solving library:
Your edit makes it no longer related to TSP.