Personal bits around AI, Programming and other things I might find interesting
zsort is a library that I started working on as a simple hobby project. More or less around the same time I decided to check which algorithms the different Common Lisp implementations use. It is now part of Quicklisp so it can be easily used (thanks Zack!). The main goal of zsort is to be … Continue reading zsort: portable sorting algorithms in Common Lisp
Which sorting algorithm should one implement when developing a program? The best answer is probably none. Use the sort provided by your system/library/etc. Unless you know your input data has some special properties that you can take advantage of, the provided sort should be enough for your needs and probably is more efficiently implemented. However, … Continue reading Sorting algorithms used in the CL implementations
Jorge Tavares Notes 