: Discussing Cook's theorem and standard NP-complete problems to identify when heuristic approaches are necessary. Resources for Further Study
Understanding the Design and Analysis of Algorithms by Gajendra Sharma design and analysis of algorithms gajendra sharma pdf
The amount of memory space required by the algorithm during its execution. Asymptotic Notations design and analysis of algorithms gajendra sharma pdf
Problems whose solutions can be verified in polynomial time, even if finding the solution takes much longer. design and analysis of algorithms gajendra sharma pdf
: Critical algorithms for Minimum Spanning Trees , Shortest Paths, and Network Flow.
The Greedy approach makes the locally optimal choice at each stage with the hope of finding a global optimum. Sharma explains classic greedy problems beautifully: Fractional Knapsack Problem Job Sequencing with Deadlines