From: brennan AT mack DOT rt66 DOT com (Brennan "The Rev. Bas" Underwood)
Newsgroups: comp.os.msdos.djgpp
Subject: Re: GDB debugging
Date: 24 Nov 1996 23:30:40 -0700
Organization: Rasterfari/Acid Brain
Lines: 17
Message-ID: <57beeg$iaa@mack.rt66.com>
References: <579aaf$l6k AT isnews DOT csc DOT calpoly DOT edu>
NNTP-Posting-Host: mack.rt66.com
To: djgpp AT delorie DOT com
DJ-Gateway: from newsgroup comp.os.msdos.djgpp

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>