# Algorithms Introduction (Course)

Algorithms Introduction (Course)

Based on: COT 5405 Algorithms I at U. of Florida.

## Contents

# Supporting Articles

# Textbooks

The primary text is *Introduction to Algorithms* by Cormen, 3rd. Sections with a "*" in the Cormen books are intended for graduate students. Passages from different books will be noted by 2nd, 3rd, or Kleinberg.

# Scheduler

## Algorithmic Paradigms and Data Structures

2nd Ch 1,2,3,4,5,7,8,9, - , 15,16,17,br /> 3rd Ch 4

### Algorithm Design and Analysis, The Basics

*Main Article: *Algorithm Design and Analysis

Correctness, time and space complexity, insertion-sort, growth of functions, asymptotic notation, big-Oh, big-Omega, big-Theta, upper bound, lower bound, tight bounds, divide-and-conquer, mergeSort, recurrences, substitution method, recursion-tree method, master theorem.

2nd Ch 1,2,3,4

## Graph Algorithms

## Geometric Algorithms

## Complexity and Approximation

# Internal Links

*Parent Article:* Course Work (Independent)