Basic paradigms for the design and analysis of efficient algorithms: recursive algorithms, sorting and searching, divide-and-conquer, hashing, reductions, and the use of randomness.

Pre-requisite(s):
CSCT 101

Facebook this Page (opens a new window)

Tweet this Page (opens a new window)

Add to Portfolio (opens a new window)