Article View: gnu.g++.help
Article #749Re: g++ and qsort
From: Charles Fiterman
Date: Mon, 28 Aug 1995 14:14
Date: Mon, 28 Aug 1995 14:14
12 lines
1079 bytes
1079 bytes
In article <DDrtu4.13r@research.att.com>, Andrew Koenig <ark@research.att.com> wrote: >In article <DDrnAF.E76@midway.uchicago.edu> Charles Fiterman <cef@geodesic.com> writes: > >> The alternative is to write a C++ template qsort that uses a temporary object >> for exchange. This would be much slower. > >Actually, it's much faster -- because it doesn't require >a function call for each comparison. Actually it depends on how expensive an objects constructor and destructor is. Most constructors are fairly expensive and involve function calls.
Technical Details
Message-ID:
<DE0y85.Du6@midway.uchicago.edu>Path:
arc1-ca.pugleaf.net!newsfeed.internetmci.com!ncar!uchinews!newsReferences:
<DDpG3H.88M@watserv3.uwaterloo.ca> <DDqM06.52K@pentagon-ai.army.mil> <DDrnAF.E76@midway.uchicago.edu> <DDrtu4.13r@research.att.com>Show Full Headers
Complete Article Headers
Newsgroups: gnu.g++.help,comp.lang.c++ Path: arc1-ca.pugleaf.net!newsfeed.internetmci.com!ncar!uchinews!news From: Charles Fiterman <cef@geodesic.com> Subject: Re: g++ and qsort X-Nntp-Posting-Host: ford.uchicago.edu Message-ID: <DE0y85.Du6@midway.uchicago.edu> Sender: news@midway.uchicago.edu (News Administrator) Organization: Geodesic Systems References: <DDpG3H.88M@watserv3.uwaterloo.ca> <DDqM06.52K@pentagon-ai.army.mil> <DDrnAF.E76@midway.uchicago.edu> <DDrtu4.13r@research.att.com> Date: Mon, 28 Aug 1995 14:14:29 GMT