Module 2 Divide and Conquer Approach

123456789101112131415161718
Across
  1. 8. A growth rate represented by O(nlogn).
  2. 9. A searching algorithm that repeatedly divides a sorted search space into two halves.
  3. 12. The central element examined during Binary Search.
  4. 14. A growth rate represented by O(logn).
  5. 15. A sorting algorithm that partitions elements around a selected pivot.
  6. 16. A mathematical expression used to represent the running time of a recursive algorithm.
  7. 17. The step of solving the smaller subproblems recursively.
  8. 18. An algorithmic approach that divides a problem into smaller subproblems, solves them, and combines their solutions.
Down
  1. 1. The element used to partition an array in Quick Sort.
  2. 2. The condition that stops a recursive algorithm from making further recursive calls.
  3. 3. The step of breaking a problem into smaller subproblems.
  4. 4. The portion of data currently being considered during a search.
  5. 5. A sorting algorithm that divides an array into halves and merges the sorted halves.
  6. 6. The step of merging the solutions of subproblems.
  7. 7. The process of rearranging elements around a pivot.
  8. 10. A technique in which a function calls itself to solve smaller instances of a problem.
  9. 11. The process of combining two sorted sequences into one sorted sequence.
  10. 13. An array whose elements are arranged in a specific order.