[Home] [Credit Search] [Category Browser] [Staff Roll Call] The LINUX.COM Article Archive
Originally Published: Monday, 4 September 2000 Author: Jeff Alami
Published to: news_develop_development/Development News Page: 1/1 - [Std View]

AVL C Library 0.1

This data structure features fast (O(log N)) insertion, removal, and retrieval of records, provided that there is a sorting relation over their keys and there are no entries with equal keys.



Originally published on Linux.com. Released under the Open Content License unless otherwise stated. Notify Gareth Watts of any errors or copyright violations.