Algorithms and Data Structures
Introduction
1.
1. Algorithm Analysis
2.
2.1 Vectors
3.
2.3 Stacks
4.
2.4 Queues
5.
2.5 Lists Sequences
6.
2.6 Trees
7.
2.7 Priority Queues
8.
2.8 Heaps
9.
2.9 Dictionary
10.
2.10 Hash Tables
11.
3.1 Binary Search Tree
12.
3.2 ALV-Trees
13.
3.3 2-4 Trees
14.
3.4 Red Black Trees
15.
3.5 Skiplists
16.
3.6 Priority Queues
17.
3.7 Locators
18.
4.1 Merge Sort
19.
4.2 Quick Sort
20.
4.3 Sorting Lower Bound
21.
4.4 Sets
22.
4.5 Bucket Sort and Radix Sort
23.
4.6 Selection
24.
5.1 Greedy Method
25.
5.2 Divide and Conquer
26.
5.3 Dynamic Programming
27.
6.1 Graphs
28.
6.2 Graph additions
29.
6.3 Deep First Search
30.
6.4 Breadth First Search
31.
6.5 Biconnectivity
32.
6.6 Directed Graphs
33.
7.1 Graph additions
34.
7.2 Deep First Search
35.
8.1 Network Flow
36.
9.1 Pattern Matching
37.
9.2 Tries
Powered by
GitBook
Algorithms and Data Structures
Algorithms and Data Structures
All the content for the Algorithms and Data Structures-Lectures