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.544µs | 0.500µs | 0.900µs |
| 3 |
C (Clang)
|
0.636µs | 0.500µs | 0.800µs |
| 4 |
D
|
0.784µs | 0.700µs | 1.000µs |
| 5 |
C++ (G++)
|
1.968µs | 1.700µs | 2.400µs |
| 6 |
Zig
|
5.080µs | 4.500µs | 5.800µs |
| 7 |
Rust
|
5.716µs | 3.900µs | 32.000µs |
| 8 |
C (GCC)
|
5.860µs | 1.600µs | 98.000µs |
| 9 |
GraalVM
|
6.360µs | 2.700µs | 75.200µs |
| 10 |
Kotlin (Native)
|
7.240µs | 5.300µs | 38.900µs |
| 11 |
Java
|
27.060µs | 20.800µs | 80.200µs |
| 12 |
Python
|
27.452µs | 24.100µs | 45.800µs |
| 13 |
Ruby
|
45.300µs | 38.700µs | 71.700µs |
| 14 |
PHP
|
55.704µs | 31.000µs | 388.300µs |
| 15 |
JavaScript (Node)
|
116.532µs | 87.100µs | 337.200µs |
| 16 |
JavaScript (Bun)
|
200.692µs | 153.300µs | 282.700µs |
| 17 |
JavaScript (Deno)
|
235.216µs | 89.800µs | 2,802.000µs |
| 18 |
Kotlin (JVM)
|
11,058.604µs | 2,114.400µs | 156,661.900µs |