CS 573
Topics in Algorithms

Credit: 4 hours.


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