Path: csiph.com!x330-a1.tempe.blueboxinc.net!aioe.org!news.glorb.com!postnews.google.com!news1.google.com!Xl.tags.giganews.com!border1.nntp.dca.giganews.com!nntp.giganews.com!local2.nntp.dca.giganews.com!nntp.earthlink.com!news.earthlink.com.POSTED!not-for-mail NNTP-Posting-Date: Tue, 10 May 2011 22:21:50 -0500 Message-ID: <4DCA00CF.3150@mindspring.com> Date: Tue, 10 May 2011 23:21:51 -0400 From: pete Reply-To: pfiland@mindspring.com Organization: PF X-Mailer: Mozilla 3.04Gold (WinNT; I) MIME-Version: 1.0 Newsgroups: comp.unix.programmer,comp.lang.c Subject: Re: Avoiding recursive stack overflow in C on Unix/Linux? References: <2f33e674-b127-4c35-89b5-dcbf564f3aab@h36g2000pro.googlegroups.com> <92rabuF51pU6@mid.individual.net> <87zkmvhyqm.fsf@temporary-address.org.uk> <87aaeui0ic.fsf@temporary-address.org.uk> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Lines: 13 X-Usenet-Provider: http://www.giganews.com NNTP-Posting-Host: 4.154.219.159 X-Trace: sv3-qq3xXEUoq/hIGwIJ1cAT8cfhyfxwy5D+j8gGrw3akkRldwlNhRxgZ7bmNS4x2Kb4lfUjIIv6rVj7kXZ!4gw7DUU1QADEhvBS1paJYcHffnp4L8burL7PbMiZIpDeqMcOOTY8vl50QxKtu+NrOnPygwAgtBSI!D/Eqdq9MS/M= X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly X-Postfilter: 1.3.40 X-Original-Bytes: 2028 Xref: x330-a1.tempe.blueboxinc.net comp.unix.programmer:496 comp.lang.c:3712 Michael Press wrote: > I could dash off qsort. Its only advantage is speed. > When I want an O(n.log n) search I write heapsort. > > By the way, qsort(3) has an irremediable security hole. I like to write sort functions with a qsort interface. http://www.mindspring.com/~pfilandr/C/q_sort/ -- pete