| Chapter 8. Data Structures |
| |
|
|
| |
1. Basic Concepts ..................................................................... |
2 |
| |
1.1 Allocation and deallocation of memory |
|
| |
1.2 Algorithm Specification |
|
| |
1.3 Performance Analysis |
|
| |
1.4 Asymptotic Notation |
|
| |
1.5 Performance Measurement |
|
| |
2. Search ................................................................................. |
3 |
| |
2.1 Sequential Search |
|
| |
2.2 Binary Search |
|
| |
3. Sort ....................................................................................... |
4 |
| |
3.1 Bubble Sort |
|
| |
3.2 Insertion Sort |
|
| |
3.3 Quick Sort |
|
| |
3.4 Comparison of Sort Methods |
|
| |
4. Linked Lists ........................................................................... |
5 |
| |
4.1 Basic |
|
| |
4.2 Singly Linked List |
|
| |
4.3 Doubly Linked List |
|
| |
5. Stacks and Queues .............................................................. |
6 |
| |
5.1 Stack |
|
| |
5.2 Queue |
|
| |
Summary ................................................................................. |
10 |