CSE331 Lecture 32

CSE331 Lecture 32 - min(a 1,a 2 max(a 1,a 2 a L = a 1,… a...

Info iconThis preview shows pages 1–13. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 32 CSE 331 Nov 14, 2011
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
HW related stuff HW 8 solutions at the end of the lecture HW 7 available for pickup
Background image of page 2
Review Sessions this week Tuesday, 1:00-1:50pm – Jesse Commons 9 (Review of covered material) Friday, 11:30am-12:20pm – Atri Bell 242 (problem solving session) For more details, check out for the blog post
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Need a blog and scribe volunteer
Background image of page 4
Counting Inversions Input: n distinct numbers a 1 ,a 2 ,…,a n Inversion: (i,j) with i < j s.t. a i > a j Output: Number of inversions
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Divide and Conquer Divide up the problem into at least two sub-problems Recursively solve the sub-problems “Patch up” the solutions to the sub-problems for the final solution Solve the stronger problem of counting inversions + sorting Solve the stronger problem of counting inversions + sorting
Background image of page 6
Three kinds of inversion 10 7 21 20 100 1 Non-crossing inversions are counted recursively
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Mergesort-Count algorithm Input: a 1 , a 2 , …, a n Output: Numbers in sorted order+ #inversion MergeSortCount ( a, n ) If n = 2 return ( a1 > a2
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 10
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 12
Background image of page 13
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: , min(a 1 ,a 2 ); max(a 1 ,a 2 )) a L = a 1 ,…, a n/2 a R = a n/2+1 ,…, a n return ( c+c L +c R ,a ) (c L , a L ) = MergeSortCount ( a L , n/2 ) (c R , a R ) = MergeSortCount ( a R , n/2 ) (c, a) = MERGE-COUNT ( a L ,a R ) Counts #crossing-inversions+ MERGE Counts #crossing-inversions+ MERGE O(n) O(n) T(2) = c T(n) = 2T(n/2) + cn O(n log n) time O(n log n) time If n = 1 return ( 0 , a 1 ) Today’s agenda MERGE-COUNT Computing closest pair of points Closest pairs of points Input: n 2-D points P = { p 1 ,…, p n }; p i =( x i , y i ) Output: Points p and q that are closest d(p i ,p j ) = ( ( x i-x j ) 2 +( y i-y j ) 2 ) 1/2 Group Talk time O(n 2 ) time algorithm? 1-D problem in time O(n log n) ? Sorting to rescue in 2-D? Pick pairs of points closest in x co-ordinate Pick pairs of points closest in y co-ordinate Choose the better of the two Rest of today’s agenda Divide and Conquer based algorithm...
View Full Document

{[ snackBarMessage ]}

Page1 / 13

CSE331 Lecture 32 - min(a 1,a 2 max(a 1,a 2 a L = a 1,… a...

This preview shows document pages 1 - 13. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online