Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword or section
Like this
2Activity
P. 1
Chap9 Slides

Chap9 Slides

Ratings: (0)|Views: 143|Likes:
Published by ainugiri

More info:

Published by: ainugiri on Aug 19, 2009
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

12/20/2012

pdf

text

original

 
Sorting Algorithms
Ananth Grama, Anshul Gupta, George Karypis, and Vipin KumarTo accompany the text “Introduction to Parallel Computing”,Addison Wesley, 2003.
 
Topic Overview
Issues in Sorting on Parallel Computers
Sorting Networks
Bubble Sort and its Variants
Quicksort
Bucket and Sample Sort
Other Sorting Algorithms
 
Sorting: Overview
One of the most commonly used and well-studied kernels.
Sorting can be
comparison-based 
or
noncomparison-based 
.
The fundamental operation of comparison-based sorting is
compare-exchange
.
The lower bound on any comparison-based sort of
n
numbersis
Θ(
n
log
n
)
.
We focus here on comparison-based sorting algorithms.

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->