Re: Finding 2 biggest numbers in a row

Article View: comp.lang.java

Article #426

#426

From: Armin Gerritsen
Date: Wed, 22 Nov 2000 00:00

17 lines
1513 bytes

>> 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...

Is dat zo? En zelf als ... het blijven branches, en bij een loop-if-branch
heb je nog kans dat de zaak binnen een cacheline blijft.

Armin
--
Philips Semiconductors B.V.
Systems Laboratory Eindhoven (PS-SLE)

Backup not found: (A)bort (R)etry (P)anic

Tools:
http://www.phys.uu.nl/~gerritsn/download.html

Technical Details

Message-ID: <8vgpa8$h7e$1@porthos.nl.uu.net>

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: f5d71,470c011dba4db9c3
X-Google-Attributes: gidf5d71,public
X-Google-Thread: fcea4,470c011dba4db9c3
X-Google-Attributes: gidfcea4,public
X-Google-Thread: 10a146,470c011dba4db9c3
X-Google-Attributes: gid10a146,public
From: "Armin Gerritsen" <Armin.Gerritsen@philips.com>
Subject: Re: Finding 2 biggest numbers in a row
Date: 2000/11/22
Message-ID: <8vgpa8$h7e$1@porthos.nl.uu.net>
X-Deja-AN: 696682723
References: <3A11B99A.2BB2E1E7@skynet.be> <8utlpa$3r5$1@news0.skynet.be> <3A12DF0E.7786684B@skynet.be>
X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3612.1700
X-Complaints-To: abuse@nl.uu.net
X-Trace: porthos.nl.uu.net 974907528 17646 212.153.190.3 (22 Nov 2000 15:38:48 GMT)
Organization: Philips Semiconductors
NNTP-Posting-Date: 22 Nov 2000 15:38:48 GMT
Newsgroups: comp.lang.java,comp.lang.java.help,comp.lang.java.programmer,be.comp.programming

Reply to Parent Message