Re: One really good use for BIG core memory (address sort)

Article View: net.arch

Article #2933

#2933

From: Robert Alverson
Date: Fri, 26 Sep 1986 15:40

5 lines
755 bytes

Clearly, this algorithm is O(k), but...usually, k is a linear
function of n, determined before starting the sort.  So it is
O(n) also.

Bob

Technical Details

Message-ID: <5559@decwrl.DEC.COM>

Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!cbatt!cbosgd!ucbvax!decwrl!alverson

References: <600@sdcc12.UUCP> <7960@lanl.ARPA>

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!cbatt!cbosgd!ucbvax!decwrl!alverson
From: alverson@decwrl.DEC.COM (Robert Alverson)
Newsgroups: net.arch
Subject: Re: One really good use for BIG core memory (address sort)
Message-ID: <5559@decwrl.DEC.COM>
Date: Fri, 26-Sep-86 11:40:54 EDT
Article-I.D.: decwrl.5559
Posted: Fri Sep 26 11:40:54 1986
Date-Received: Tue, 30-Sep-86 03:47:47 EDT
References: <600@sdcc12.UUCP> <7960@lanl.ARPA>
Reply-To: alverson@decwrl.UUCP (Robert Alverson)
Organization: Digital Equipment Corporation
Lines: 5
Summary: O(k) = O(n)

Reply to Parent Message