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 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/lecture08.html http://www.cl.cam.ac.uk/teaching/2004/IntroFuncProg/lecture0...