Zabin Visram Room 9 n n Lecture Structure

Zabin Visram Room 9 n n Lecture Structure Previous Lectures ¨ n n n Searching Algorithms – analysis - performance Next few lecturers - Sorting Algorithms Several - sorting algorithms & some analysis on these algorithms Simple Sorts Selection Sort ¨ Bubble Sort ¨ CS 126 ZV 2004 Selection Sort 1

Task in pairs – sort the following books in order of height shortest book first – how would you do it? n There are several ways CS 126 ZV 2004 Selection Sort 2

Did you use this method ? n n Select the shortest book since you want it to be the first on shelf, you remove the first book on the shelf and put the shortest book in its place. You still have a book in your hand so put it in the place – formerly occupied by the shortest book Now ignore the shortest book and repeat the process for the rest of the bookshelf This is Selection Sort in a way CS 126 ZV 2004 Selection Sort 3

Selection Sort smallest element method n The basic idea of selection sort is to scan through the list finding the smallest element and placing the element in the first position of the list. n CS 126 ZV 2004 Selection Sort 4

Selection Sort – Array Based List Let consider the smallest element sorting algorithm n The selection sort algorithm sorts a list by selecting the smallest element in the(unsorted portion of the) list, and then moving this smallest element to the beginning of the (unsorted) list n The first time we locate the smallest item in the entire list, the second time we locate the smallest item in the list starting from the second element in the list, and so on. n CS 126 ZV 2004 Selection Sort 5

List of 10 elements Initially the entire list is unsorted. So we find the smallest item in the list, which is at position 7 Smallest [0] 16 [1] 30 [2] 24 [3] 7 [4] 25 [5] 62 [6] 45 [7] 5 [8] 65 [9] 50 Unsorted list Smallest element of the unsorted list CS 126 ZV 2004 Selection Sort 6

List of 10 elements Initially the entire list is unsorted. So we find the smallest item in the list, which is at position 7 Smallest [0] 16 [1] 30 [2] 24 [3] 7 [4] 25 [5] 62 [6] 45 [7] 5 [8] 65 [9] 50 Unsorted list Smallest element of the unsorted list Because this is the smallest item, it must be moved to position 0. We therefore swap 16 (that is list [0] with 5 (that is list [7]) swap [0] 16 [1] 30 [2] 24 [3] 7 [4] 25 [5] 62 [6] 45 Swap elements list[0] and list[7] CS 126 ZV 2004 Selection Sort [7] 5 [8] 65 [9] 50 7

List after swapping list [0] and list [7] [0] 5 [1] 30 [2] 24 [3] 7 [4] 25 [5] 62 [6] 45 [7] 16 [8] 65 [9] 50 Unsorted list Now the unsorted list is list[1]…list[9], Next we find the smallest element in the unsorted portion of the list. The smallest element is at position 3 [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] 5 30 24 7 25 62 45 16 65 50 Unsorted list Smallest element in the unsorted portion of the list CS 126 ZV 2004 Selection Sort 8

Because the smallest element in the unsorted list is at position 3, it must be moved to position 1. That is , we swap 7 (list [3]) with 30 (list[1]) swap Swap list[1] with list[3] [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] 5 30 24 7 25 62 45 16 65 50 Unsorted list CS 126 ZV 2004 Selection Sort 9

Because the smallest element in the unsorted list is at position 3, it must be moved to position 1. That is , we swap 7 (list [3]) with 30 (list[1]) swap Swap list[1] with list[3] [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] 5 30 24 7 25 62 45 16 65 50 Unsorted list List after swapping list[1] with list[3] [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] 5 7 24 30 25 62 45 16 65 50 Unsorted list CS 126 ZV 2004 Selection Sort 10

Consider the smallest element sorting algorithm n n The basic idea of this selection sort is to scan through the list finding the smallest element and placing the element in the first position of the list. That smallest element is the beginning of a sorted segment. Then we find the smallest in the remaining unsorted list and place it again at the beginning of the unsorted list. CS 126 ZV 2004 Selection Sort 11

Consider the largest element sorting algorithm n To place it at the beginning of the unsorted segment we use a standard swap method as follows: n public static void swap(int data[], int i, int j) { //pre: 0 <= i, j <= data. length //post: data[i] and data[j] are exchanged int temp; temp = data[i]; data[i] = data[j]; data[j] = temp; n n n n n } CS 126 ZV 2004 Selection Sort 12