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.540µs | 0.500µs | 0.700µs |
| 3 |
C (Clang)
|
0.612µs | 0.500µs | 0.800µs |
| 4 |
C++ (G++)
|
2.056µs | 1.800µs | 2.800µs |
| 5 |
C (GCC)
|
2.208µs | 1.900µs | 2.800µs |
| 6 |
GraalVM
|
4.528µs | 3.100µs | 8.900µs |
| 7 |
Rust
|
4.692µs | 3.900µs | 5.700µs |
| 8 |
Kotlin (Native)
|
6.384µs | 5.800µs | 7.200µs |
| 9 |
Zig
|
7.084µs | 4.900µs | 43.800µs |
| 10 |
Python
|
24.720µs | 21.600µs | 53.200µs |
| 11 |
Java
|
26.280µs | 20.500µs | 55.900µs |
| 12 |
PHP
|
51.040µs | 39.500µs | 89.900µs |
| 13 |
Ruby
|
67.008µs | 39.200µs | 435.300µs |
| 14 |
JavaScript (Node)
|
110.248µs | 88.500µs | 176.700µs |
| 15 |
JavaScript (Deno)
|
219.492µs | 85.800µs | 2,189.400µs |
| 16 |
JavaScript (Bun)
|
265.896µs | 194.600µs | 669.300µs |
| 17 |
Kotlin (JVM)
|
5,542.732µs | 2,116.300µs | 72,754.200µs |