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

O(n logn + n)??? do you think computing power grows on trees?


Then use Perl. Perl has this weird feature where "reverse(sort(...))" gets optimized into a single op.




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

Search: