Mac 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 |
C (Clang)
|
0.242µs | 0.196µs | 0.742µs |
| 2 |
C++ (Clang++)
|
0.353µs | 0.275µs | 0.490µs |
| 3 |
GraalVM
|
0.364µs | 0.287µs | 0.610µs |
| 4 |
D
|
0.388µs | 0.300µs | 0.500µs |
| 5 |
C (GCC)
|
0.512µs | 0.447µs | 0.741µs |
| 6 |
C++ (G++)
|
0.640µs | 0.000µs | 1.000µs |
| 7 |
Go
|
0.840µs | 0.000µs | 1.000µs |
| 8 |
Rust
|
1.880µs | 1.000µs | 3.000µs |
| 9 |
Zig
|
3.640µs | 3.000µs | 5.000µs |
| 10 |
Kotlin (Native)
|
6.136µs | 5.408µs | 8.215µs |
| 11 |
Python
|
23.680µs | 19.000µs | 53.000µs |
| 12 |
Java
|
25.033µs | 18.066µs | 91.024µs |
| 13 |
PHP
|
29.693µs | 26.877µs | 46.021µs |
| 14 |
Ruby
|
35.960µs | 29.000µs | 60.000µs |
| 15 |
JavaScript (Deno)
|
93.333µs | 76.232µs | 144.750µs |
| 16 |
JavaScript (Node)
|
127.808µs | 85.445µs | 810.847µs |
| 17 |
JavaScript (Bun)
|
233.887µs | 153.719µs | 514.381µs |
| 18 |
Kotlin (JVM)
|
25,457.351µs | 1,480.229µs | 543,143.678µs |