Algorithms

• Binary Search - Efficiently finds an item from a sorted list by dividing the interval in half.
• Quick Sort - A divide-and-conquer algorithm that uses a pivot for sorting arrays.
• Merge Sort - Recursively sorts and merges halves of an array.
• Depth-First Search (DFS) - Traverses as far down a branch as possible before backtracking.
• Breadth-First Search (BFS) - Explores nodes at each level before moving deeper.
• Dijkstra's Algorithm - Finds the shortest paths in a weighted graph.
• Knapsack Problem - Maximizes value without exceeding capacity.