Linux 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 |
GraalVM
|
0.566µs | 0.461µs | 0.872µs |
| 2 |
C (GCC)
|
0.728µs | 0.481µs | 1.082µs |
| 3 |
C++ (G++)
|
0.776µs | 0.451µs | 1.172µs |
| 4 |
Go
|
1.032µs | 0.952µs | 1.192µs |
| 5 |
C (Clang)
|
1.327µs | 1.022µs | 1.884µs |
| 6 |
Zig
|
1.340µs | 1.162µs | 1.664µs |
| 7 |
C++ (Clang++)
|
1.455µs | 1.122µs | 2.274µs |
| 8 |
Kotlin (Native)
|
5.176µs | 3.467µs | 26.301µs |
| 9 |
Python
|
26.511µs | 19.817µs | 45.236µs |
| 10 |
PHP
|
43.879µs | 36.418µs | 48.722µs |
| 11 |
JavaScript (Bun)
|
212.670µs | 154.412µs | 868.346µs |
| 12 |
JavaScript (Deno)
|
228.530µs | 88.178µs | 3,130.219µs |
| 13 |
JavaScript (Node)
|
414.604µs | 85.963µs | 7,874.525µs |
| 14 |
Java
|
987.625µs | 21.761µs | 24,020.337µs |
| 15 |
Rust
|
2,923.035µs | 1.022µs | 73,040.619µs |
| 16 |
Ruby
|
4,742.710µs | 31.619µs | 66,526.263µs |
| 17 |
Kotlin (JVM)
|
66,536.185µs | 1,938.723µs | 143,862.943µs |