daa

Edit Answers
12345678910
Across
  1. 3. What kind of algorithm solves a problem by solving smaller instances of the same problem? (10 letters)
  2. 7. What is the term for measuring the performance of an algorithm? (9 letters)
  3. 8. Which sorting algorithm works by repeatedly selecting the smallest element from the unsorted part and moving it to the sorted part? (9 letters, 4 letters)
  4. 9. What is a sequence of instructions designed to perfo
  5. 10. Which notation describes the average-case scenario for an algorithm's running time? (1 letter and a number)
Down
  1. 1. What is the name of the simple sorting algorithm that compares each pair of adjacent items and swaps them if they are in the wrong order? (6 letters, 4 letters)
  2. 2. What is the method called when you search through a list one element at a time until you find the target? (10 letters, 6 letters)
  3. 4. A sorting algorithm that builds the final sorted array one item at a time.
  4. 5. Which notation describes the worst-case scenario for an algorithm's running time? (1 letter and a number)
  5. 6. Which notation describes the best-case scenario for an algorithm's running time? (1 letter and a number)