C Algorithms Library
The C programming language includes a very limited standard library in comparison to other modern programming languages. This is a collection of common Computer Science data structures and algorithms which may be used in C projects.
The code is licensed under the Modified BSD license, and as a result may be reused in any project, whether Proprietary or Open Source.
- ArrayList : Automatically resizing array.
- Doubly linked list : A set of values stored in a list with links that point in both directions.
- Singly linked list : A set of values stored in a list with links that point in one direction.
- Queue : Double ended queue which can be used as a FIFO or a stack.
- Set : Unordered set of values.
- Hash table : Collection of values which can be addressed using a key.
- Trie : Fast mapping using strings as keys.
- AVL tree : Balanced binary search tree with O(log n) worst case performance.
All of the above data structures operate on void pointers. It is sometimes necessary to compare values (when sorting a list, for example) or generate a hash key (in a hash table or set). This is done by providing a pointer to a function which provides this functionality. The following functions provide this functionality for some common data types.
Generated on Mon Jan 30 18:56:23 2006 for C Algorithms by
1.4.4