11
votes
Vote UpVote

Delphi is fast, very fast

Compas Pascal – Jesper Hald and others recently did a benchmark of a certain algorithm to figure out, which was fastest. It evolved into a kind of competition to make the fastest algorithm to solve this problem:Fill a data structure with 1,000,000 random, unsorted values from 0-100 Run through this data structure 200 times, counting a) number of values = 42 b) average for all 1,000,000*200 valuesThe benchmark
Favorite? Off-Topic? Lars D @ 2009-06-25 00:22

Statistics

Visits: 1368
Votes: 11
Favorites: 0
Off-Topic: 0

Visits by Source

User Actions

Users who voted for this posting

Charles Ardour
Dennis G.
Ericc
Jim McKeeth
Kyle A. Miller
Lars Fosdal
Mohammed Nasman
Rif..
Sergio
stukelly
Tier777
Subscribe:
Contact us to advertise on DelphiFeeds.com

Community Links

Torry Firebird News

Sponsor

 
Please login or register to use this functionality.
(click on this box to dismiss)