Top Banner
Divide and Conquer Counting Inversion s I Design and Analysis of Algorithms I
6

Counting Inversions I

Feb 20, 2016

Download

Documents

lerato

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
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Counting Inversions I

Divide and ConquerCounting Inversions I

Design and Analysis of Algorithms I

Page 2: Counting Inversions I

Tim Roughgarden

The Problem

Page 3: Counting Inversions I

Tim Roughgarden

Examples and Motivation

Page 4: Counting Inversions I

15

21

3664

What is the largest-possible number of inversions that a 6-element array can have?

Page 5: Counting Inversions I

Tim Roughgarden

High-Level Approach

Page 6: Counting Inversions I

Tim Roughgarden

High-Level Algorithm