X hits on this document

Powerpoint document

Lower Bounds & Sorting in Linear Time - page 19 / 28

78 views

0 shares

0 downloads

0 comments

19 / 28

Comp 122

linsort - 19

Lin / Devi

Comp 122

Bucket Sort

Assumes input is generated by a random process that distributes the elements uniformly over [0, 1).

Idea:

»

Divide [0, 1) into n equal-sized buckets.

»

Distribute the n input values into the buckets.

»

Sort each bucket.

»

Then go through the buckets in order, listing elements in each one.

Document info
Document views78
Page views78
Page last viewedFri Dec 09 12:24:16 UTC 2016
Pages28
Paragraphs427
Words1924

Comments