| |
Dec 14, 2025
|
|
|
|
|
CSC 318 - Algorithms Credits: 3 Function Growth and Complexity; Divide and Conquer, Heapsort; Quicksort, Linear-Time Sort, Hash Tables, Binary Search Trees, Red-Black Trees, Dynamic Programming; Greedy Algorithms, Breadth-First Search; Depth-First Search, Minimal Spanning Tree, Single-Source Shortest Path, All-Pair Shortest Paths, Linear Programming, NP Completeness, and Approximation Algorithms.
Prerequisite(s): C or better CSC 218 . Offered: F.
Add to Favorites (opens a new window)
|
|