Course

Implementation of sorting algorithms – Bubble sort, Insertion Sort, Selection Sort, QuickSort- Merge Sort, Heap implementation using array, Heap sort, performance comparison of sorting algorithms for various classes of inputs like nearly sorted, unsorted etc.O(V2) and O( E log V) implementations of Dijkstra algorithm, BFS and DFS implementation,graph cycle detection using BFS. Topological sort using DFS, Prims and Kruskals MST. Divide and conquer implementation of Maximum subarray sum Dynamic Programming based solution for 0-1 Knapsack problem, Recursive matrix chainMultiplication, Longest common substring,