Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

To be honest, I've given a quick look at the implementation in Mathematica, and I think one could do much better.

The code is mostly wrapped in Compile statements and is very procedural in style.

As a quick test I compared their quicksort with the built in Sort obtaining results about 30 times faster than theirs.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: