Counting Inversions I
6
Divide and Conquer Counting Inversion s I Design and Analysis of Algorithms I
description
Divid e and Conquer. Counting Inversions I. Design and Analysis of Algorithms I. The Problem. Examples and Motivation. What is the largest-possible number of inversions that a 6-element array can have?. 15. 21. High-Level Approach. High-Level Algorithm. - PowerPoint PPT Presentation
Transcript of Counting Inversions I
Divide and ConquerCounting Inversions I
Design and Analysis of Algorithms I
Tim Roughgarden
The Problem
Tim Roughgarden
Examples and Motivation
15
21
36
64
What is the largest-possible number of inversions that a 6-element array can have?
Tim Roughgarden
High-Level Approach
Tim Roughgarden
High-Level Algorithm