Across
- 2. Technique in which a function calls itself repeatedly to solve smaller subproblems.
- 5. Sorting algorithm where adjacent elements are repeatedly swapped until the list is sorted.
- 6. Algorithm used to find the minimum spanning tree in a graph.
- 7. Greedy algorithm used to find the shortest path from a single source.
- 9. Dynamic programming algorithm used to find the shortest paths between all pairs of vertices.
- 10. Divide-and-conquer search algorithm used for sorted arrays.
Down
- 1. Backtracking problem where queens must be placed on a chessboard without attacking each other.
- 3. Asymptotic notation used to represent the tight bound of an algorithm's complexity
- 4. Divide and conquer sorting algorithm with time complexity O(n log n).
- 8. Optimization problem used in greedy and dynamic programming approaches.