a) Linear Searching b) Binary Searching
a) Insertion Sort b) Selection Sort c) Bubble Sort
a) Merge Sort b) Quick Sort c) Heap Sort
a) Counting Sort b) Radix Sort
a) Shell Sort
a) Activity Selection Problem b) Knapsack Problem (Greedy)
a) 0/1 Knapsack (DP) b) LCS (Longest Common Subsequence)
a) Kruskal's Algorithm b) Prim's Algorithm
a) Dijkstra's Algorithm b) Bellman-Ford Algorithm c) Warshall's Algorithm (All Pair)
a) N-Queen Problem b) Sum of Subset Problem
DATA ANALYSIS AND ALGORITHM
