Re: g++ and qsort

Article View: gnu.g++.help

Article #742

#742

From: Andrew Koenig
Date: Wed, 23 Aug 1995 16:01

10 lines
767 bytes

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.
-- 
				--Andrew Koenig
				  ark@research.att.com

Technical Details

Message-ID: <DDrtu4.13r@research.att.com>

Path: arc1-ca.pugleaf.net!in1.uu.net!allegra!alice!ark

References: <DDpG3H.88M@watserv3.uwaterloo.ca> <DDqM06.52K@pentagon-ai.army.mil> <DDrnAF.E76@midway.uchicago.edu>

Show Full Headers

Complete Article Headers

Newsgroups: gnu.g++.help,comp.lang.c++
Path: arc1-ca.pugleaf.net!in1.uu.net!allegra!alice!ark
From: ark@research.att.com (Andrew Koenig)
Subject: Re: g++ and qsort
Message-ID: <DDrtu4.13r@research.att.com>
Organization: AT&T Bell Laboratories, Murray Hill NJ
References: <DDpG3H.88M@watserv3.uwaterloo.ca> <DDqM06.52K@pentagon-ai.army.mil> <DDrnAF.E76@midway.uchicago.edu>
Date: Wed, 23 Aug 1995 16:01:15 GMT

Reply to Parent Message