DAA

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