| Details: |
Study of algorithms; efficient, optimal algorithms and analysis for best, worst, and average performance; computational complexity theory; algorithmic time and space bounds; levels of intractability; applications. May not be taken for credit by students who have received credit for CS 413. |
