Ibukun Olumuyiwa escreveu:
This was originally what I wanted to do actually -- implement a list-based quicksort (would require use of Ecore_Dlist). But it is much more efficient as it is, doing an insertion sort while actually inserting items into the list.
I guess generally one just make the compare function a callback, and leave the sort method on the list.
Solerman ------------------------------------------------------- SF.Net email is Sponsored by the Better Software Conference & EXPO September 19-22, 2005 * San Francisco, CA * Development Lifecycle Practices Agile & Plan-Driven Development * Managing Projects & Teams * Testing & QA Security * Process Improvement & Measurement * http://www.sqe.com/bsce5sf _______________________________________________ enlightenment-devel mailing list enlightenment-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/enlightenment-devel
