By Topic

On teaching median-finding algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Gurwitz, C. ; Dept. of Comput. & Inf. Sci., Brooklyn Coll., NY, USA

The relationship between quicksort and fast median algorithms is discussed. Both of these algorithms are often taught in the context of an undergraduate analysis of algorithms course, but the relationship between these methods is not usually perceived by the students

Published in:

Education, IEEE Transactions on  (Volume:35 ,  Issue: 3 )