Introduction
Direct Recursive Algorithms
An algorithm that calls itself is direct recursive
Stacks
A stack is a list in which insertions and deletions can be done only at the end.
Time Complexity
How fast an algorithm is working
Sub Set Sum Problem
Given a set of non-negative integers, and a value sum, determine if there is a subset of the given set with sum equal to given sum.
Graph Coloring
In a graph, no two adjacent vertices, adjacent edges, or adjacent regions are colored with minimum number of colors
Asymptotic Notation
Notations to represent complexity of an algorithm
Red Black Trees
Self Balancing Btrees. Each node of the binary tree has an extra bit, and that bit is often interpreted as the color of the node.
Spanning Tree
All the nodes in the graph will appear in the spanning tree
0-1 Knapsack
Given a Knapsack of a maximum capacity of W and N items each with its own value and weight, throw in items inside the Knapsack such that the final contents has the maximum value.
Greedy Algorithm
A greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the locally optimal choice at each stage with the intent of finding a global optimum.