QuickSort vs. MergeSort: An Introduction to Sorting Algorithms

Abstract

Sorting algorithms are a useful lens through which to begin the study of algorithms in general. In this talk we will explore the mechanisms and benefits of recursive algorithms, show how to leverage the recursion to compute the run time of an algorithm, and touch upon how different algorithms respond to different cases.

Bio

Karen Edwards has 26 years of teaching experience with a wide variety of audiences, from community colleges to large state universities, as well as liberal arts colleges and K-12 professional development programs. She studied mathematics at Princeton and Berkeley, receiving her PhD from Berkeley in low-dimensional geometric topology. She is currently a lecturer at Harvard. In her spare time, she enjoys the intricate rhythms and sounds of international folk singing and folk dancing.