How is the qsort function in <stdlib.h> ( Turbo C/C++ ) implemented ????

Article View: comp.std.c

Article #3710

#3710

From: Mattias Andersson
Date: Sat, 12 Aug 1995 13:45

10 lines
779 bytes

Are there any one out there how knows how the qsort funktion in
<stdlib.h> ( Turbo C/C++ ) is implemented. 

 void qsort( void *base , size_t n , size_t size , int (*compar)(const
void * , const void *  ))

I would be really glad if someone coud tell me how it works.


Thank you all out there.

Technical Details

Message-ID: <40ib9g$4sl@spider.hik.se>

Path: arc1-ca.pugleaf.net!news.hik.se!usenet

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!news.hik.se!usenet
From: mandi93@tufvan.hv.se (Mattias Andersson)
Newsgroups: comp.std.c
Subject: How is the qsort function in <stdlib.h> ( Turbo C/C++ ) 
 implemented ????
Date: 12 Aug 1995 13:45:20 GMT
Organization: hlmf93@tufvan.hv.se
Sender: -Not-Authenticated-[3354]
Message-ID: <40ib9g$4sl@spider.hik.se>
NNTP-Posting-Host: 194.47.75.39
X-Posted-From: InterNews 1.0.5@labb6.hv.se
Xdisclaimer: No attempt was made to authenticate the sender's name.