Re: Finding 2 biggest numbers in a row

Article View: comp.lang.java

Article #439

#439

From: timvw
Date: Wed, 15 Nov 2000 00:00

9 lines
1390 bytes

Bart Vandewoestyne <

> > Andy Georges heeft gelijk, zoeken in een niet-gesorteerde rij is altijd
> > O(n)... Waarom wil je per se recursief werken?
>
> Because my algorithm would require less comparisons...

got any proof of that?

Technical Details

Message-ID: <974317270.369813@marvin>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

References: <3A11B99A.2BB2E1E7@skynet.be> <8utlpa$3r5$1@news0.skynet.be> <3A12DF0E.7786684B@skynet.be>

Show Full Headers

Complete Article Headers

X-Google-Language: DUTCH,ASCII-7-bit
X-Google-Thread: 113ae9,470c011dba4db9c3
X-Google-Attributes: gid113ae9,public
X-Google-Thread: 10a146,470c011dba4db9c3
X-Google-Attributes: gid10a146,public
X-Google-Thread: fcea4,470c011dba4db9c3
X-Google-Attributes: gidfcea4,public
X-Google-Thread: f5d71,470c011dba4db9c3
X-Google-Attributes: gidf5d71,public
From: "timvw" <timvw@kotnet.org>
Subject: Re: Finding 2 biggest numbers in a row
Date: 2000/11/15
Message-ID: <974317270.369813@marvin>
X-Deja-AN: 694023876
Cache-Post-Path: marvin!unknown@kn-10-0-51-001.kotnet.kuleuven.ac.be
References: <3A11B99A.2BB2E1E7@skynet.be> <8utlpa$3r5$1@news0.skynet.be> <3A12DF0E.7786684B@skynet.be>
X-Priority: 3
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2615.200
X-Complaints-To: abuse@belnet.be
X-Trace: naxos.belnet.be 974317270 18079 134.58.127.3 (15 Nov 2000 19:41:10 GMT)
Organization: KULeuvenNet
X-MSMail-Priority: Normal
X-Cache: nntpcache 2.3.3 (see http://www.nntpcache.org/)
NNTP-Posting-Date: Wed, 15 Nov 2000 19:41:10 +0000 (UTC)
Newsgroups: comp.lang.java,comp.lang.java.help,comp.lang.java.programmer,be.comp.programming

Reply to Parent Message