Teaching data structures
• adjacency matrix, adjacency list
• Degree of all vertices, connected component, checking connectivity
• Breadth-first search
• Shortest path
• Topological sort
• All shortest paths from a vertex
• Spanning trees: Kruskal, Prim
• Cycle detection: union-find
• Numerical algorithms: GCD, exponentiation, integer multiplication
• Strings
• Text search (brute force, Rabin-Karp, Knuth-Morris-Pratt, others)
• Edit distance
• Pattern matching by regular expressions, advanced regular expressions
• Categories of algorithms: divide and conquer, greedy, dynamic programming,
search
• Tractability: constant, logarithmic, linear, quadratic
• Decision problems: P, NP
Sumber: Finkel, Raphael, 2009. How to Teach Data Structures.
Author: rasp
Saya adalah pejuang, pekerja informatics ipos, mujahid fi sabil lillaah, hamba Allah SWT.
View all posts by rasp
