Windows 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 |
Go
|
0.000µs | 0.000µs | 0.000µs |
| 2 |
C++ (Clang++)
|
0.556µs | 0.400µs | 0.800µs |
| 3 |
C (Clang)
|
0.680µs | 0.500µs | 1.000µs |
| 4 |
D
|
0.832µs | 0.700µs | 0.900µs |
| 5 |
C (GCC)
|
1.904µs | 1.600µs | 2.300µs |
| 6 |
C++ (G++)
|
2.084µs | 1.500µs | 2.700µs |
| 7 |
GraalVM
|
3.596µs | 2.700µs | 5.100µs |
| 8 |
Zig
|
5.300µs | 4.600µs | 6.200µs |
| 9 |
Rust
|
5.452µs | 4.000µs | 26.000µs |
| 10 |
Kotlin (Native)
|
14.084µs | 5.300µs | 213.600µs |
| 11 |
Java
|
23.680µs | 21.200µs | 28.500µs |
| 12 |
Python
|
29.380µs | 24.500µs | 73.700µs |
| 13 |
PHP
|
49.656µs | 34.000µs | 285.900µs |
| 14 |
JavaScript (Deno)
|
99.212µs | 80.700µs | 128.000µs |
| 15 |
JavaScript (Node)
|
116.052µs | 89.500µs | 288.200µs |
| 16 |
JavaScript (Bun)
|
525.688µs | 146.500µs | 4,231.200µs |
| 17 |
Ruby
|
1,464.724µs | 36.400µs | 30,706.300µs |
| 18 |
Kotlin (JVM)
|
2,820.136µs | 2,094.700µs | 5,025.700µs |