That only applies in an apples-to-apples comparison, i.e., same data structures, same algorithm, etc. You can't compare sorting in C and Python, but use bubble sort in C and radix sort in Python.

In here there are different data structures being used.

> D[HO] and Julia [HO] footnote: Uses specialized datastructures meant for demonstration purposes: more ↩ ↩2

You're right of course but it also depends on how long you want to spend on it. If Python gives you radix sort directly and the C implementation you can have with the same time is bubble sort because you spent much time setting up the project and finding the right libs it kinda makes sense.

Python doesn't come with Radix sort, and Julia doesn't come with

     [[deps.SuperDataStructures]]
     git-tree-sha1 = "7222b821efcee6dcdc9e652455da09c665d8afc1"
     repo-rev = "main"
     repo-subdir = "SuperDataStructures.jl"

Don't know about D but C, Zig and Rust use LLVM so there should be no difference.

Depends on the D compiler. The reference compiler optimizes for compilation speed. LDC is backed by llvm and gdc by gcc.