1. 1 © 2006 Pearson Addison-Wesley. All rights reserved Searching and Sorting Selection Sort -Reading p.382-386 -Reading p.718-722

2. 2 © 2006 Pearson Addison-Wesley. All rights reserved Sorting an Array A sort method takes in an array parameter a, and rearranges the elements in a, so that after the method call is finished, the elements of a are sorted in ascending order A selection sort accomplishes this by using the following algorithm: for (int index = 0; index < count; index++) Place the indexth smallest element in a[index]

3. 3 © 2006 Pearson Addison-Wesley. All rights reserved Selection Sort (Part 1 of 2)

4. 4 © 2006 Pearson Addison-Wesley. All rights reserved Selection Sort (Part 2 of 2)

5. 5 © 2006 Pearson Addison-Wesley. All rights reserved SelectionSort Class (Part 1 of 5) public class SelectionSort { /** Precondition: count <= a.length; The first count indexed variables have values. Action: Sorts a so that a[0] <= a[1] <=... <= a[count - 1]. */

6. 6 © 2006 Pearson Addison-Wesley. All rights reserved SelectionSort Class (Part 2 of 5) public static void sort(double[] a, int count) { int index, indexOfNextSmallest; for (index = 0; index < count - 1; index++) {//Place the correct value in a[index]: indexOfNextSmallest = indexOfSmallest(index, a, count); interchange(index,indexOfNextSmallest, a); //a[0]<=a[1]<=...<=a[index] and these are //the smallest of the original array //elements. The remaining positions contain //the rest of the original array elements. }

7. 7 © 2006 Pearson Addison-Wesley. All rights reserved SelectionSort Class (Part 3 of 5) /** Returns the index of the smallest value among a[startIndex], a[startIndex+1],... a[numberUsed - 1] */ private static int indexOfSmallest(int startIndex, double[] a, int count) { double min = a[startIndex]; int indexOfMin = startIndex; int index;

8. 8 © 2006 Pearson Addison-Wesley. All rights reserved SelectionSort Class (Part 4 of 5) for (index = startIndex + 1; index < count; index++) if (a[index] < min) { min = a[index]; indexOfMin = index; //min is smallest of a[startIndex] through //a[index] } return indexOfMin; }

9. 9 © 2006 Pearson Addison-Wesley. All rights reserved SelectionSort Class (Part 5 of 5) /** Precondition: i and j are legal indices for the array a. Postcondition: Values of a[i] and a[j] have been interchanged. */ private static void interchange(int i, int j, double[] a) { double temp; temp = a[i]; a[i] = a[j]; a[j] = temp; //original value of a[i] }

10. 10 © 2006 Pearson Addison-Wesley. All rights reserved GeneralizedSelectionSort class: sort Method

11. 11 © 2006 Pearson Addison-Wesley. All rights reserved GeneralizedSelectionSort class: sort Method

12. 12 © 2006 Pearson Addison-Wesley. All rights reserved GeneralizedSelectionSort class: interchange Method

13. 13 © 2006 Pearson Addison-Wesley. All rights reserved Sorting Arrays of Comparable

14. 14 © 2006 Pearson Addison-Wesley. All rights reserved Sorting Arrays of Comparable

15. 15 © 2006 Pearson Addison-Wesley. All rights reserved Sorting Arrays of Comparable