CSCI 3100
Algorithms
Saint Louis University · UGRD · Fall 2026
1 section
Catalog description
Introduction to analysis and complexity of algorithms. Big-O notation. Running time analysis of algorithms for traversing graphs and trees, searching and sorting. Recursive versus iterative algorithms. Complexity, completeness, computability.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #saint_louis-CSCI3100Fall 2026UGRD3 credits
- Days & times
- No scheduled meeting time
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?