Please enable JavaScript.
Coggle requires JavaScript to display documents.
Analysis of Algorithm (Divide and Conquer (Merge Sort Analysis, Quick Sort…
Analysis of Algorithm
Introduction
Growth of function
Big-Oh
Omega
Theta notation
Mathematical Background for algorithm analysis
Randomized and Recursive algorithm
Performance analysis
Time Complexity
Space Complexity
Design and analysis fundamentals
Divide and Conquer
Merge Sort Analysis
Quick Sort analysis
Finding Min & Max
Binary Search
General Method
Selection sort, Radix Sort Efficiency
Strassen's Matrix Multiplication
Greedy Method
General Method
Job Sequencing with Deadlines
Kruskal and Primal Alogrithm
Optimal Storage on tapes
Knapsack Problem
Dynamic Programming
Multistage Graphs
General Method
All Pairs Shortest Path
Travelling Salesman Problem
Branch & Bound
Bounding
15 Puzzle Example
FIFO Branch & Bound
LC Branch & Bound
LC Search
General Method
TP Efficiency Considerations
Backtracking
Sum of Subsets
Graph Coloring
8 Queen Problem
Hamiltonian Cycles
General Method
Knapsack Problem