Algorithms

>> Topological Sort of Directed Acyclic Graph

>> Finding Articulation Points of a Graph

>> The Quicksort Algorithm

>> Kruskal’s vs Prim’s Algorithm

>> 0-1 Knapsack: A Problem With NP-Completeness and Solvable in Pseudo-Polynomial Time

>> Stemming vs Lemmatization

>> Divide and Conquer Algorithms

>> Shortest Path to Certain Nodes in a Graph

>> Fibonacci: Top-Down vs Bottom-Up Dynamic Programming

>> Constituency Parsing vs Dependency Parsing