Revision as of 08:41, 20 November 2022 edit Adakiko (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 98,974 edits m Reverted edits by 89.80.44.25 (talk): not providing a reliable source (WP:CITE, WP:RS) (HG) (3.4.10) Tag: Rollback ← Previous edit		Revision as of 10:00, 11 January 2023 edit undo Cewbot (talk \| contribs) Bots 8,374,018 edits m Fixing broken anchor: 2021-09-01 #Dynamic memory allocation→Memory management#Manual memory management Next edit →
Line 52: It was a design choice from the start to only include very simple toy problems, each providing a different kind of programming challenge.<ref>{{cite web\|url=https://benchmarksgame-team.pages.debian.net/benchmarksgame/why-measure-toy-benchmark-programs.html\|title=Why toy programs? – The Computer Language Benchmarks Game\|website=benchmarksgame-team.pages.debian.net/benchmarksgame\|accessdate=29 May 2018}}</ref> This provides users of the Benchmark Game the opportunity to scrutinize the various implementations.<ref>{{cite web\|url=https://benchmarksgame-team.pages.debian.net/benchmarksgame/description/nbody.html#nbody\|title=n-body description (64-bit Ubuntu quad core) – Computer Language Benchmarks Game\|website=benchmarksgame-team.pages.debian.net/benchmarksgame\|accessdate=29 May 2018}}</ref> * [[Memory management#~~Dynamic~~Manual memory ~~allocation~~management\|binary-trees]] * [[Synchronization (computer science)#Thread or process synchronization\|chameneos-redux]] * [[Permutation\|fannkuch-redux]]

The Computer Language Benchmarks Game: Difference between revisions