Ah, this brings up a memory. I had written the decrease and conquer algorithm once for the convex hull problem in C. It's not quite efficent, the whole thing is 240 lines. It was "homework" too: http://www.komal.hu/verseny/2001-12/I.h.shtml.
But the other algorithms for finding the convex hull might be more difficult to write.
In reply to Re: Re: [OT][HOMEWORK] Algorithms Help
by ambrus
in thread [OT][HOMEWORK] Algorithms Help
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |