News for hackers. Stuff that matters.
Re:Big O Notation – Explained as easily as possible by mhh__ on Saturday January 16, 2021 @01:18PM (#25804090)
Anecdotally (it was a contrived sorting benchmark so the exact numbers don't really matter), Python started off about 3 times slower than D, but and grew at what would be considered the same O() but the coefficient was enormous. To the point where a D was taking 3s for n-million arrays, Python closer to one minute.

Node was actually very impressive, roughly as fast as D's reference compiler (cutting edge optimisations maybe 2 decades ago) in release mode.

There are no comments on this comment yet.