Comments on: Sorting algorithms used in the CL implementations http://jorgetavares.com/2012/02/02/sorting-algorithms-used-in-the-cl-implementations/ Sat, 23 Mar 2013 14:06:05 +0000 hourly 1 http://wordpress.com/ By: Saira http://jorgetavares.com/2012/02/02/sorting-algorithms-used-in-the-cl-implementations/#comment-296 Thu, 24 May 2012 11:12:37 +0000 http://jorgetavares.com/?p=823#comment-296 , the algorithm has its uses, lemtiid as they may be, but it is actually very similar to a hash sort. If you hash your inputs and then insert the hash values into hash table, you get a very rough hash sort. Of course, this greatly increases the complexity, but it would reduce your memory footprint while increasing your speed, especially if you hash all new inputs as they come in to maintain a sorted table at all time.

]]> By: Jorge Tavares http://jorgetavares.com/2012/02/02/sorting-algorithms-used-in-the-cl-implementations/#comment-275 Mon, 23 Apr 2012 14:45:00 +0000 http://jorgetavares.com/?p=823#comment-275 Hi Kyle,

Thanks for your comment and the info regarding ACL. I would guess merge sort was the choice for stable-sort but it’s good to have a confirmation. As for lists, merge sort is the best choice when dealing with linked lists so it should not come as a surprise its use for lists (just remembered that after writing the post).

]]> By: Kyle McGivney http://jorgetavares.com/2012/02/02/sorting-algorithms-used-in-the-cl-implementations/#comment-274 Mon, 23 Apr 2012 14:13:05 +0000 http://jorgetavares.com/?p=823#comment-274 Regarding ACL, I can confirm that merge sort is used for stable-sort and sorting lists. If you trace the unexported function #’excl::merge-lists* while executing a sort, you can see the merges happening. I don’t know what is used when sort is called on an array. I would guess quicksort.

]]>