A data strucutre is a systematic way of organizing and acessing data. An algorithm is a step-by-step procedure for perfomring some task in a finite amount of time. These concepts are central to computing but to be able to classify some data structures and algorithms as 'good', we must have precise ways of analyzing them.
Contents:
- Recursion
- Array-based sequence
- stacks
- Queues
- Linked list
- Trees
- Priority queues
- Maps,Hash tables and Sets
- Search trees
- Sorting algorithm
- Graph algorithm
- Text processing
- Memory management and B-Trees