Practice Implementation Of Merge Procedure With Counting (12.9) - Divide and Conquer: Counting Inversions

Practice: Implementation of Merge Procedure with Counting

Lesson 12.9Divide and Conquer: Counting Inversions

Practise this section

9 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Define an inversion in the context of rankings.
Show hintHide hint
Think about pairs of items in terms of order.
Question 2.
What is the time complexity of counting inversions using the brute-force method?
Show hintHide hint
Consider the number of comparisons you need for each item.
3Question 3.
What is the time complexity of counting inversions using merge sort?
- O(n^2)
- O(n log n)
- O(n)
Show hintHide hint
Think about how merging elements affects overall performance.
4Question 4.
True or False: Every pair of rankings with no inversions are identical.
- True
- False
Show hintHide hint
Reflect on the definition of inversion.
Question 5.
Design an algorithm that counts inversions in O(n log n) time and identify its key components.
Show hintHide hint
Focus on how merging sorted lists relates to counting inversions.
Question 6.
Given two users' ranking lists, A = [3, 1, 2, 5, 4] and B = [2, 1, 3, 5, 4], find the number of inversions between them.
Show hintHide hint
Consider how to map one ranking into the order of another.

5 more questions in this section. Enroll free to practise them all.