Find a university to explore its courses and reviews.
Mathematical analysis of algorithms including searching, sorting, matrix multiplication, fast Fourier transform, and graph algorithms. Time and space complexity, upper-bound, lower-bound, average-case analysis, and introduction to NP completeness.
No one has reviewed this course yet. Share your experience and help future students know what to expect.
Takes about 2 minutes. Every review is anonymous — no account needed.