Title :
On teaching median-finding algorithms
Author_Institution :
Dept. of Comput. & Inf. Sci., Brooklyn Coll., NY, USA
fDate :
8/1/1992 12:00:00 AM
Abstract :
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
Keywords :
algorithm theory; computer science education; teaching; computer science; education; median-finding algorithms; quicksort algorithms; students; teaching; undergraduate; Algorithm design and analysis; Education; Information science; Lead; Partitioning algorithms; Sorting; Strips;
Journal_Title :
Education, IEEE Transactions on
