@Robert: You can look for a similar problem here : https://www.spoj.pl/problems/BSHEEP/ For algorithm I suggest you to go for Graham's scan or Quick hull.
On Sat, Oct 31, 2009 at 1:39 AM, Robert Berman <berma...@cfl.rr.com> wrote: > Hello Shashwat, > > I have saved the web page for a much more detailed review after I work > through the suggestions given by Alan et all. It is obvious that a casual > read is not going to be enough. > > Thank you for the information. > > Robert > > > > On Fri, 2009-10-30 at 23:49 +0530, Shashwat Anand wrote: > > The problem belongs to 'Convex Hull' superset. > look into : http://en.wikipedia.org/wiki/Convex_hull_algorithms > > > On Thu, Oct 29, 2009 at 6:05 PM, Robert Berman <berma...@cfl.rr.com> > wrote: > > > Kent and Alan, > > Thank you both for providing me with tools I can use to develop the sort > portion of my algorithm. They are invaluable. I really appreciate Luke's > willingness to examine and advise on the full algorithm and once it is > written (only the function that determines distance between two points > is written and working) I will definitely add it to pastebin and ask for > your suggestions as well as the suggestions and comments from the group. > > Again, thank you for your help. > > Robert > > > > _______________________________________________ > Tutor maillist - Tutor@python.org > To unsubscribe or change subscription options: > http://mail.python.org/mailman/listinfo/tutor > > >
_______________________________________________ Tutor maillist - Tutor@python.org To unsubscribe or change subscription options: http://mail.python.org/mailman/listinfo/tutor
