{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Selection

Selection - Quick-Sort 8:56 AM The Selection Problem Given...

This preview shows pages 1–2. Sign up to view the full content.

Selection 1 Selection Selection 2 The Selection Problem Given an integer k and n elements x 1 , x 2 , …, x n , taken from a total order, find the k-th smallest element in this set. Of course, we can sort the set in O(n log n) time and then index the k-th element. Can we solve the selection problem faster? 7 4 9 6 2 2 4 6 7 9 k=3 Selection 3 Quick-Select (§10.7) Quick-select is a randomized selection algorithm based on the prune-and-search paradigm: Prune : pick a random element x (called pivot ) and partition S into L elements less than x E elements equal x G elements greater than x Search : depending on k, either answer is in E , or we need to recur on either L or G x x L G E k < | L | |L| < k < | L |+| E| (done) k > | L |+| E| k’ = k - |L| - |E| Selection 4 Partition We partition an input sequence as in the quick-sort algorithm: We remove, in turn, each element y from S and We insert y into L , E or G , depending on the result of the comparison with the pivot x Each insertion and removal is at the beginning or at the end of a sequence, and

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern