The sorting.lisp example does some stuff:

• Create a list of random numbers
• Sort them
  • First of all with insertion-sort
  • Then with quick-sort
  • Finally with the golang sort
• Finally iterate over the results and make sure the results match

However the last step is incomplete - we generate a list of 512 integers, however we only test the first 20 or so results. While that's probably indicative of success it isn't sufficient to prove it.

The reason we don't test all the numbers is because the operation of (nth) is so. damn. slow.

nth could be moved to golang, to make it super-fast, or it could be improved in other ways. Decide, and do the necessary.