Algorithm
Course Content
Introduction
-
Introduction to Algorithm Asymptotic Notations, Complexities
35:30 -
Questions Introduction to Algorithm Asymptotic Notations, Complexities
59:01
Recurrence Relation
Divide & Conquer
Sorting Selection Insertion Bubble
Heap Sort
Optimal Merge Pattern using Greedy Method
Prim’s, Dijkstra’s, BFS & DFS Graph Traversal
Hashing and Hashing Techniques
Dynamic Programming
P, NP, NP Hard & NP Complete
How Quick Sort Works
Huffman Coding
Introduction to Greedy Techniques
Job Sequencing
Knapsack Problem
Kruskal Algorithm
Notes
Student Ratings & Reviews
No Review Yet