pChapter 12 presents several common algorithms for sorting an array of integers. pTwo slow but simple algorithms are Selectionsort and Insertionsort. pThis presentation demonstrates how the two algorithms work.
Quadratic Sorting
Data Structures
and Other Objects
Using Java
The presentation illustrates two quadratic sorting algorithms: Selectionsort and Insertionsort. Before this lecture, students should know about arrays, and should have seen some motivation for sorting (such as binary search of a sorted array).