Merge Sort, Quick Sort, and Binary Search. Greedy Algorithms
: Breaking a problem into smaller sub-problems, solving them individually, and merging the results (e.g., Merge Sort , Quick Sort). design analysis and algorithms
While classical DAA (Sorting, Searching, Graph theory) is mature, the field is not dead. New frontiers are emerging: Merge Sort, Quick Sort, and Binary Search