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.515µs | 0.400µs | 0.691µs |
| 2 |
C (GCC)
|
0.757µs | 0.490µs | 1.152µs |
| 3 |
C++ (G++)
|
0.809µs | 0.470µs | 1.213µs |
| 4 |
D
|
0.832µs | 0.800µs | 0.900µs |
| 5 |
Go
|
1.056µs | 0.942µs | 1.372µs |
| 6 |
Zig
|
1.346µs | 1.183µs | 1.613µs |
| 7 |
C++ (Clang++)
|
1.367µs | 1.022µs | 1.974µs |
| 8 |
C (Clang)
|
1.506µs | 1.082µs | 5.751µs |
| 9 |
Rust
|
2.513µs | 0.972µs | 20.388µs |
| 10 |
Kotlin (Native)
|
4.414µs | 3.467µs | 5.951µs |
| 11 |
Python
|
24.472µs | 20.849µs | 32.661µs |
| 12 |
Java
|
27.986µs | 23.333µs | 42.490µs |
| 13 |
JavaScript (Bun)
|
177.719µs | 149.320µs | 205.516µs |
| 14 |
PHP
|
561.813µs | 37.080µs | 13,042.062µs |
| 15 |
JavaScript (Node)
|
1,041.498µs | 81.994µs | 23,617.829µs |
| 16 |
Ruby
|
1,187.985µs | 29.736µs | 28,762.459µs |
| 17 |
JavaScript (Deno)
|
2,196.596µs | 92.884µs | 52,231.050µs |
| 18 |
Kotlin (JVM)
|
56,032.498µs | 1,954.506µs | 142,650.817µs |