Spring 2008

CS 573
Topics in Algorithms

Credit:  4 hours.


Theoretical analysis of various algorithms: sorting, searching, selection, polynomial evaluation, matrix multiplication, and multiplication of real numbers. Same as CSE 515. May be repeated. Prerequisite: CS 473.

Available Spring 2008