CS 230 - Design & Analysis of Algorithms

Credits: 3

This course explores the design, analysis, and implementation of fundamental algorithms, such as sorting and searching. This course includes an introduction to complexity analysis of algorithms with an emphasis on identifying efficient methods for searching, sorting, finding spanning trees and shortest paths in graphs.
Prerequisite: CS 110
Offered: Spring