Crossword Puzzle Of The Week #14 (for Divide and Conquer Algorithm)

In this issue of Crossword Puzzle of the Week, we will dive into the topics of Divide and Conquer Algorithms The solution to the crossword puzzle is provided at the end.

Crossword Puzzle Of The Week #13 (for Divide and Conquer Algorithm)

HINTS:

Down:

1. _____ is defined as a sorting algorithm that works by dividing an array into smaller subarrays, sorting each subarray, and then merging the sorted subarrays back together to form the final sorted array.

2. _____ involves dividing the problem into smaller sub-problems.

3. _____ Solve sub-problems by calling recursively until solved.

4. _____ is a method of computing the convex hull of a finite set of points in the plane. It uses a divide and conquer approach similar to that of quicksort

5. It is a mathematical problem based on Divide and conquer in which we find that number raised to the power of its own reverse.

Across:

6. _____ is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the picked pivot.

7. The ______ method of matrix multiplication is a typical divide and conquer algorithm.

8. ______ for an array indicates – how far (or close) the array is from being sorted. If the array is already sorted, then the inversion count is 0, but if the array is sorted in reverse order.

9. _____ problem can be solved using Divide and Conquer where Given a n by n board where n is of form 2k where k >= 1 (Basically n is a power of 2 with minimum value as 2). The board has one missing cell (of size 1 x 1). Fill the board using L shaped tiles. A L shaped tile is a 2 x 2 square with one cell of size 1×1 missing.

10. A ______ is the smallest convex polygon containing all the given points. Input is an array of points specified by their x and y coordinates. The output is the convex hull of this set of points.

Solution for Crossword Puzzle #14:

Crossword Puzzle Of The Week #13 (for Divide and Conquer Algorithm)

Answers:

Down:

1. MERGE SORT

2. DIVIDE

3. CONQUER

4. QUICKHULL

5. POWER OF NUMBERS

Across:

6. QUICK SORT

7. STRASSENS

8. COUNT INVERSION

9. TILING

10. CONVEXHULL