Table of Content
1.1
2007/10/19 07:56:37.614 GMT-5
2007/11/11 05:26:53.489 US/Central
Data Structures and Algorithms
Contents
- Introduction to Algorithms
- Problem solution
- Data models
- Data models in programming languages
- Data structures
- Algorithms analysis
- Linked lists
- Singly linked lists
- Doubly linked lists
- Circular linked lists
- Table transform
- Stack and Queue
- Stack
- Queue
- Priority queue
- Recursion
- Introduction to recursion
- Recursion analysis
- Tail recursion
- Recursion and stack
- Course-of-values recursion
- Potential recursion
- Transfinite recursion
- Simultaneous recursion
- Back tracking
- Conclusion
- Binary search trees
- Introduction to binary trees
- Expected node depth
- Analyzing height
- Post mortem
- Heap
- Sorting
- Basic sort algorithms
- Insertion sort
- Selection sort
- Bubble sort
- Effectively sorting algorithms
- Shell sorting
- Heap sort
- Quicksort
- Merge sort
- Graphs
- Graph representation
- Graph analysis
- Minimum spanning trees
- Boruvska’s algorithms
- Kruskal’s algorithms
- Jarnik-Prim’s algorithms
- Shortest paths
- Properties of shortest paths
- Dijkstra’s algorithms
- Breadth-first search
- Bellman-Ford algorithms
- Johnson’s algorithms
- Union-find problem
- Connectivity
- Non-direction connectivity
- Direction connectivity
- Topological sort
- Hashing
- Introduction to hashing algorithms
- Hash list
- Hash table
- Hash tree
- Choosing hash function
- Universal hashing
- Perfect hashing