Practice Graphical Representation Of Inversions (12.5) - Divide and Conquer: Counting Inversions

Practise this section

9 questions

Flashcard drill
4 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 what an inversion is.
Show hintHide hint
Think about two people's different preferences.
Question 2.
What is the time complexity of a brute-force method to count inversions?
Show hintHide hint
Consider how many comparisons are made.
3Question 3.
What is an inversion?
- A pair ranked similarly
- A ranking disagreement
- A sorting algorithm
Show hintHide hint
Recall the definition we discussed.
4Question 4.
True or False: The brute force method is the most efficient way to count inversions.
- True
- False
Show hintHide hint
Think about the performance of the two methods.
Question 5.
Given the array [10, 20, 30, 40], if a new number '25' is added, how many inversions are created?
Show hintHide hint
Check the new number against existing numbers to see if they form inversions.
Question 6.
Using your knowledge of merge sort, detail the steps to count inversions for the array [7, 5, 6, 4].
Show hintHide hint
Break down the problem and count during each merge step.

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