From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,14bff0642983a2a5 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-07-30 09:45:09 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!msunews!not-for-mail From: "Chad R. Meiners" Newsgroups: comp.lang.ada Subject: Re: sorting large numbers of large records Date: Wed, 30 Jul 2003 12:41:05 -0400 Organization: Michigan State University Message-ID: References: <1ec946d1.0307300655.2ad33d81@posting.google.com> NNTP-Posting-Host: arctic.cse.msu.edu X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2800.1158 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2800.1165 Xref: archiver1.google.com comp.lang.ada:41029 Date: 2003-07-30T12:41:05-04:00 List-Id: "Matthew Heaney" wrote in message news:1ec946d1.0307300655.2ad33d81@posting.google.com... > You could also map the entire file, to view it as one large array. Doing so would be very slow compared to the algorithms Vinzent Hoefler referenced.