Mail Archives: djgpp/1996/11/25/02:20:01
In article <579aaf$l6k AT isnews DOT csc DOT calpoly DOT edu>,
Aaron Dwyer <adwyer AT galaxy DOT csc DOT calpoly DOT edu> wrote:
> I'm currently finishing up an implementation of quicksort in DJGPP to
>sort polygons far to near, classic painter's algo situation...BUT...my
[snip]
Try using the libc qsort() function to prototype first. It's a pretty
good implementation. I had all these ideas for optimizing my sorting
until I profiled my program... qsort (and components) took less than 2%
of the time.
--Brennan
--
brennan AT rt66 DOT com | vi rules.
Riomhchlaraitheoir|
Rasterfarian | <http://brennan.home.ml.org>
- Raw text -