avl-tree

AVL (Adelson-Velsky-Landis) Tree is a self-balancing binary search tree implementation in Common Lisp. See README file for details.

Download ASDF package from http://www.students.itu.edu.tr/~yazicivo/files/avl-tree.tar.gz (Tarball comes with the latest .git source tree. Feel free to play with it.)

mathematics library

CLiki pages can be edited by anyone at any time. Imagine a fearsomely comprehensive disclaimer of liability. Now fear, comprehensively