Fast List Data Structure

Tolga Birdal

Rate me:

3.13/5 (10 votes)

4 Sep 2007CPOL3 min read

34.8K

439

A fast data structure based on a linked list and dynamic array. This list has O(1) add, delete, and access time.

Views

Daily Counts

Downloads

Weekly Counts

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Written By

Tolga Birdal

CEO Gravi Information Technologies and Consultancy Ltd

Turkey

Currently, also an MSc. student in Technical University of Munich, I develop practical application in computer vision for more than 5 years. I design real-time solutions to industrial and practical vision problems, both 3D and 2D. Very interested in developing algorithms in C relating math and vision.

Please visit Gravi's web page (http://www.gravi.com.tr) and my page (http://www.tbirdal.me) to learn more about what we develop.

I admire performance in algorithms.

"Great minds never die, they just tend to infinity..."

Fast List Data Structure

Views

Downloads

License

Comments and Discussions