12.1. Divide and Conquer Paradigm

Try these first

1. 1.

   What is the divide and conquer strategy?

   Hint

   Consider how different sorting algorithms operate.

2. 2.

   Define an inversion in ranking.

   Hint

   Think about how two users might rate the same movies.

3. 3.

   What best describes the divide and conquer paradigm?

   • A method of sorting items by color.
   • Breaking problems into subproblems and combining results.
   • A technique for finding the maximum number in an array.

   Hint

   Think about how sorting algorithms operate.

4. 4.

   True or False: Inversions measure similarity in rankings.

   • True
   • False

   Hint

   Consider what inversions represent in user rankings.

5. 5.

   Given an array of numbers, implement the merge and count algorithm to find the number of inversions. Justify your approach and discuss potential edge cases.

   Hint

   Focus on both counting inversions and maintaining the sorted order.

6. 6.

   Create a real-world example where you would apply counting inversions in a recommendation system. What data would you need?

   Hint

   Think about how other users' ratings can influence the recommendations.