Re: Sorting records using sort()
From: Martijn Lievaart (m_at_remove.this.part.rtij.nl)
Date: 01/04/04
- Next message: Martijn Lievaart: "Re: return in void functions"
- Previous message: Rob Williscroft: "Re: Compare sign in C++"
- In reply to: Elijah Bailey: "Re: Sorting records using sort()"
- Next in thread: Elijah Bailey: "Re: Sorting records using sort()"
- Reply: Elijah Bailey: "Re: Sorting records using sort()"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Sun, 04 Jan 2004 19:19:44 +0100
On Sun, 04 Jan 2004 04:15:33 +0000, Elijah Bailey wrote:
[ csc++ removed, not relevant for what I want to say ]
> First problem to qsort: It's slower than using sort()
Qsort is slower only if std::sort can inline the comparison. In this case
this seems to me that with all the other overhead qsort will actually be
faster (let alone easier).
M4
- Next message: Martijn Lievaart: "Re: return in void functions"
- Previous message: Rob Williscroft: "Re: Compare sign in C++"
- In reply to: Elijah Bailey: "Re: Sorting records using sort()"
- Next in thread: Elijah Bailey: "Re: Sorting records using sort()"
- Reply: Elijah Bailey: "Re: Sorting records using sort()"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]