• Jan 26, 2026 design and analysis of algorithms for cs2251 hortest path algorithm Limitations: Not always optimal; requires problem-specific proof of correctness Backtracking and Branch and Bound Backtracking: Recursive approach for exploring all possible options Used in solving puzzles like Sudoku, N-Queens Branch and Bound: Pruning techniques to el By Andrea Bode
