Algorithms Design and Analysis C Programming For Beginners Compiler Design Data Structure Introduction What is an Algorithm and It's Characteristics Asymptotic Notations in Algorithm Space Complexity Searching Techniques Linear Search Binary Search Algorithm Sorting Algorithms Bubble Sort Algorithm with Example Insertion Sort Algorithm with Example Selection Sort Algorithm with Example Comparison of Sorting Algorithms with Respect to Time and Space Divide and Conqure Techniques Quick Sort Algorithm With Example Merge Sort Algorithm with Example Difference Between Merge and Quick Sort Strassen's Matrix Multiplications Heap & Heap Sort Greedy Techniques Breath First Search (BFS) in Greedy Depth First Search (DFS) in Greedy Difference between BFS and DFS Algorithms Spanning Tree in Greedy Prim's Algorithm in Greedy kruskal's Algorithm in Greedy Difference between Kruskal's and Prim's Algorithm Dijkstra's Algorithm in Greedy Knapsack Prolem Backtracking Backtraking N-Queens Problem Introduction What is an Algorithm and It's Characteristics Asymptotic Notations in Algorithm Space Complexity Searching Techniques Linear Search Binary Search Algorithm Sorting Algorithms Bubble Sort Algorithm with Example Insertion Sort Algorithm with Example Selection Sort Algorithm with Example Comparison of Sorting Algorithms with Respect to Time and Space Divide and Conqure Techniques Quick Sort Algorithm With Example Merge Sort Algorithm with Example Difference Between Merge and Quick Sort Strassen's Matrix Multiplications Heap & Heap Sort Greedy Techniques Breath First Search (BFS) in Greedy Depth First Search (DFS) in Greedy Difference between BFS and DFS Algorithms Spanning Tree in Greedy Prim's Algorithm in Greedy kruskal's Algorithm in Greedy Difference between Kruskal's and Prim's Algorithm Dijkstra's Algorithm in Greedy Knapsack Prolem Backtracking Backtraking N-Queens Problem Knapsack Prolem