Analysis of Algorithm: Course Outline
The analysis of algorithms is the determination of the amount of resources (such as time and storage) necessary to execute them. Most algorithms are designed to work with inputs of arbitrary length.
Course Outline
 Introduction to analysis of algorithms
 Insertion sort, merge sort
 Asymptotic notation, recurrences, substitution
 Master method
 Divide and conquer, strassen, Fibonacci polynomial multiplication
 Quicksort, randomized algorithms
 Linear time sorting, lower bounds, counting sort, radix sort
 Order statistics median
 Hashing and hash functions
 Universal hashing, perfect hashing
 Relation of bsts to quick sort, analysis of random bst
 Red black trees, rotations, insertions, deletions
 Augmenting datastructures, dynamic order statistics, interval trees
 Skiplists
 Amortizedalgorithmstabledoublingpotentialmethod
 Competitiveanalysisselforganizinglists
 Dynamicprogramming
 longestcommonsubsequence
 Greedyalgorithms
 Minimumspanningtrees
 Class & Method Design
 Shortest paths
 Dijkstras algorithm
 Breadthfirstsearch
 Shortest paths, bellman ford
 Linear programming difference constraints
 All pairs shortest paths
 Matrixmultiplication
 Floyd warshall algo
Text Book
Related Books (Full Text)

by SoltysKulinicz, Michael
Pages 211
Date Published July 2012 
by Stephens, Rod
Date Published 2013
Pages 625