Skip to content

Benchmarks

Algorithm Benchmarks

Explore local implementation measurements for core algorithm families. Results are deterministic benchmark runs for specific JavaScript implementations, not universal rankings.

Families

4

Algorithms tested

33

Measured cases

2,083

Correctness failures

0

How to Read These Results

Benchmarks measure specific local JavaScript implementations on deterministic inputs. Results depend on runtime, hardware, implementation details, and input shape. They are not universal algorithm rankings.

Contextual results

Benchmark Families

Read-only summaries from generated benchmark outputs

Sorting

Generated Apr 28, 2026, 12:07 PM

0 failures

Compares readable sorting implementations across numeric input profiles such as random, sorted, reverse, duplicates, and small-range integers.

Algorithms

10

Input profiles

7

Measured

200

Skipped

80

Family caveat

Native JavaScript sort is included as a runtime baseline, while quadratic algorithms are skipped at larger sizes.

Correctness checkedLocal benchmark

Outputs

JSON, Summary JSON, Markdown, CSV

View details

Searching

Generated Apr 28, 2026, 12:07 PM

0 failures

Measures exact search, bound queries, and hash lookup baselines across deterministic target patterns.

Algorithms

10

Profiles / targets

6 / 7

Measured

1,395

Skipped

465

Family caveat

Sorted-input algorithms skip unsupported fixtures, and hash lookup is a data-structure baseline rather than a direct ordered-array comparison.

Correctness checkedLocal benchmark

Outputs

JSON, Summary JSON, Markdown, CSV

View details

Graph Traversal

Generated Apr 28, 2026, 12:07 PM

0 failures

Benchmarks traversal and graph-query implementations across deterministic adjacency-list graph shapes.

Algorithms

8

Graph profiles

10

Measured

380

Skipped

1,300

Family caveat

BFS, DFS, components, topological sort, and cycle detection answer different graph questions, so summaries stay task-specific.

Correctness checkedLocal benchmark

Outputs

JSON, Summary JSON, Markdown, CSV, Chart data

View details

Pathfinding

Generated Apr 28, 2026, 12:07 PM

0 failures

Measures grid pathfinding implementations across obstacles, weighted terrain, no-path cases, and start/goal patterns.

Algorithms

5

Grid profiles

8

Measured

108

Skipped

12

Family caveat

BFS-style methods skip weighted grids; greedy best-first search is validated for path validity but is not treated as optimal.

Correctness checkedLocal benchmark

Outputs

JSON, Summary JSON, Markdown, CSV, Chart data, Path overlays

View details

Compare Benchmark Families

Lightweight controls for comparing current generated benchmark summaries

4 shown
FamilyMeasuredSkippedFailuresAlgorithmsProfiles / tasksOutputsDetails
Graph Traversal3801,3000810 graph profiles
ChartsCSVSummary
View details
Pathfinding10812058 grid profiles
ChartsOverlaysCSVSummary
View details
Searching1,3954650106 / 7 profiles / targets
CSVSummary
View details
Sorting200800107 input profiles
CSVSummary
View details

What's Included

The public page summarizes existing benchmark artifacts without exposing engine controls

Deterministic fixtures
Correctness validation
Explicit skip reasons
JSON, Markdown, and CSV outputs
Chart-ready data for graph traversal and pathfinding
No live benchmark execution on this page

Coming Next

Deeper chart views and richer comparison controls are planned later. This overview keeps the public surface focused on interpretation, coverage, and correctness status.

More charts plannedRead-only