Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
betterunix
on June 16, 2013
|
parent
|
context
|
favorite
| on:
Algorithms from the “Book”
I would definitely include merge sort on this list, since it is simultaneously simple and efficient. Also, if we are willing to include data structures in this, I would throw in a vote for skew binary random access lists:
http://www.cl.cam.ac.uk/teaching/2004/IntroFuncProg/lecture0...
Join us for
AI Startup School
this June 16-17 in San Francisco!
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
http://www.cl.cam.ac.uk/teaching/2004/IntroFuncProg/lecture0...