@Shashi: It has been discussed before, and an O(n^2 log n) solution is
outlined at
https://groups.google.com/d/msg/algogeeks/fBhXY9aUNJ0/CTB_p7uO8YYJ and is
given in more detail at
https://groups.google.com/d/msg/algogeeks/fBhXY9aUNJ0/0S0zK6HdKdMJ.
Dave
On Monday, October 1, 2012 12:00:19
thanks @dave
*Shashi Kant *
***Think positive and find fuel in failure*
*System/Software Engineer*
*Hewlett-Packard India Software Operations.
*
On Mon, Oct 1, 2012 at 10:42 PM, Dave dave_and_da...@juno.com wrote:
@Shashi: It has been discussed before, and an O(n^2 log n) solution is