This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: unsorted input A complete 8input sorting network OddEven Recursive Constrution of an OddEven Sorter Length m Sorter Length m Sorter m x m OE Merger unsorted n / 2 unsorted n / 2 sorted n Sorter Depth D s ( n ) = D s ( n /2) + D m ( n ) D s (2) = 1 D s ( n ) = ((1 + log n ) log n ) / 2 = O ( log 2 n ) log n OddEven Merge / Sort ) 1 ( ) 1 )(log (log 4 1 ) 2 ( and ) ( ) 2 ( 2 ) ( 2 log ) log 1 ( ) ( 1 ) 2 ( and ) ( ) 2 ( ) ( 1 2 log 2 ) ( 1 ) 2 ( and 1 2 ) 2 ( 2 ) ( log ) ( 1 ) 2 ( and 1 ) 2 ( ) (+⇒ = + = + = ⇒ = + = + = ⇒ =+ = = ⇒ = + = n n n n C n C n C n C n n n D D n D n D n D n n n C C n n C n C n n D D n D n D S M S S S S M S S M M M M M M M M...
View
Full Document
 Spring '10
 DEO
 Algorithms, Sort, Konrad Zuse, Merging Network, Batcher, merg. netw

Click to edit the document details