Design & Analysis of Algorithm- Unit-II | Algorithm Analysis-, Complexity Theory | P,NP,NP hard
Analysis: Input size, best case, worst case, average case
Counting Dominant operators, Growth rate, upper bounds
asymptotic growth, O, Ω, Ɵ, o and ω notations
polynomial and non-polynomial problems, deterministic and non-deterministic algorithms, P- class problems, NP-class of problems, Polynomial problem reduction NP complete problems- vertex cover and 3-SAT and NP hard problem - Hamiltonian cycle.