Across
- 2. An approach to problem-solving that involves examining every possible solution (6 letters)
- 3. A type of notation used to describe the lower bound of an algorithm's runtime (10 letters)
- 7. A type of notation used to describe the average case of an algorithm's runtime (10 letters)
- 8. Type of algorithm analysis that focuses on the growth rate of the algorithm's runtime (12 letters)
- 10. A systematic set of instructions for solving a problem (9 letters)
- 13. Sorting algorithm known for its simplicity but inefficiency (15 letters)
- 15. An algorithmic approach that involves dividing a problem into smaller subproblems (15 letters)
Down
- 1. An algorithmic technique for searching through a list one element at a time (10 letters)
- 4. A sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order (11 letters)
- 5. An algorithmic technique for searching through a list by dividing it into halves (12 letters)
- 6. Matching: The process of comparing strings to find a particular pattern (14 letters)
- 9. A type of notation used to describe the upper bound of an algorithm's runtime (10 letters)
- 11. An algorithm that involves comparing elements and swapping them until the list is sorted (13 letters)
- 12. The process of examining the efficiency of an algorithm (8 letters)
- 14. The process of analyzing the performance of an algorithm (10 letters)