- Department of Computer Science
- Vision, Mission, & Values
- Degrees & Programs
- Courses
- First Year Transfer Students
- Current Students
- Prospective Students
- Faculty & Staff
- Professors Emeritus
- Industrial Advisory Board
- Financial Assistance
- Employment Opportunities
- Donate
- Graduate Capstone
- Careers for Majors
- Resources
- Contact Us
- Help for Students
Algorithms
Section 2b: Analysis of Algorithms
- Analysis Framework
- Asymptotic notations: big-oh, little-oh, big theta, big omega, little omega
- Worst-case, best-case, average-case analysis of algorithms
- Recursive Functions and Recurrence Relations
- Graph Algorithms
- Kruskal's algorithm and Prim's algorithm
- Dijkstra's algorithm
- Breadth-first search (BFS) and depth-first search (DFS).
- Analysis of fundamental algorithms such as searching and sorting