X hits on this document

Powerpoint document

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

57 views

0 shares

0 downloads

0 comments

13 / 28

Comp 122

linsort - 13

Lin / Devi

Comp 122

What values of k are practical?

Good for sorting 32-bit values? No. Why?

16-bit? Probably not.

8-bit? Maybe, depending on n.

4-bit? Probably, (unless n is really small).

Counting sort will be used in radix sort.

Document info
Document views57
Page views57
Page last viewedFri Oct 28 14:26:15 UTC 2016
Pages28
Paragraphs427
Words1924

Comments