CSCI 5004
Introduction to Algorithms

Course Description

Introduction to analysis and complexity of algorithms. Big-O notation. Running time analysis of algorithms for traversing graphs and trees, searching and sorting. Recursive versus iterative algorithms. Complexity, completeness, computability.

Prerequisite(s):

CSCI 5002