Mac Benchmark: Jump Search (x5)
Jump Search is a search algorithm that “jumps” between elements within a sorted array, then performs a linear search. Performs a linear search through 25 sorted integers for the third, ninth, 13th, 16th, and 21st elements. Implementations modified from to GeeksforGeeks.
number
search
All-Time Rankings
| Rank | Language | Average Time | Best Time | Worst Time |
|---|---|---|---|---|
| 1 |
C (Clang)
|
0.246µs | 0.211µs | 0.511µs |
| 2 |
C++ (Clang++)
|
0.365µs | 0.302µs | 0.574µs |
| 3 |
C++ (G++)
|
0.560µs | 0.000µs | 1.000µs |
| 4 |
C (GCC)
|
0.560µs | 0.463µs | 1.591µs |
| 5 |
Go
|
0.800µs | 0.000µs | 1.000µs |
| 6 |
Rust
|
2.080µs | 1.000µs | 3.000µs |
| 7 |
GraalVM
|
2.350µs | 0.300µs | 50.307µs |
| 8 |
Zig
|
3.680µs | 3.000µs | 4.000µs |
| 9 |
Kotlin (Native)
|
6.214µs | 5.693µs | 6.797µs |
| 10 |
Java
|
19.919µs | 18.314µs | 24.546µs |
| 11 |
Python
|
22.280µs | 21.000µs | 26.000µs |
| 12 |
PHP
|
31.039µs | 26.802µs | 76.473µs |
| 13 |
Ruby
|
31.280µs | 30.000µs | 34.000µs |
| 14 |
JavaScript (Node)
|
132.392µs | 90.590µs | 749.712µs |
| 15 |
JavaScript (Bun)
|
166.507µs | 153.238µs | 235.645µs |
| 16 |
JavaScript (Deno)
|
206.910µs | 86.736µs | 2,885.375µs |
| 17 |
Kotlin (JVM)
|
10,396.246µs | 1,573.255µs | 64,492.551µs |