1. Java Programming: From Problem Analysis to Program Design, 3e Chapter 10 Applications of Arrays (Searching and Sorting) and Strings

7. Search (continued)

8. Search (continued)

11. Bubble Sort

12. Bubble Sort (continued)

13. Bubble Sort (continued)

16. Selection Sort (continued)

17. Selection Sort (continued)

18. Selection Sort (continued) public static void selectionSort( int [] list, int listLength) { int index; int smallestIndex; int minIndex; int temp; for (index = 0; index < listLength – 1; index++) { smallestIndex = index; for (minIndex = index + 1; minIndex < listLength; minIndex++) if (list[minIndex] < list[smallestIndex]) smallestIndex = minIndex; temp = list[smallestIndex]; list[smallestIndex] = list[index]; list[index] = temp; } }

21. Insertion Sort (continued)

22. Insertion Sort (continued)

23. Insertion Sort (continued)

24. Insertion Sort (continued) public static void insertionSort( int [] list, int listLength) { int firstOutOfOrder, location; int temp; for (firstOutOfOrder = 1; firstOutOfOrder < listLength; firstOutOfOrder++) if (list[firstOutOfOrder] < list[firstOutOfOrder - 1]) { temp = list[firstOutOfOrder]; location = firstOutOfOrder; do { list[location] = list[location - 1]; location--; } while(location > 0 && list[location - 1] > temp); list[location] = temp; } } //end insertionSort

26. Sequential Ordered Search public static int seqOrderedSearch( int [] list, int listLength, int searchItem) { int loc; //Line 1 boolean found = false ; //Line 2 for (loc = 0; loc < listLength; loc++) //Line 3 if (list[loc] >= searchItem) //Line 4 { found = true ; //Line 5 break ; //Line 6 } if (found) //Line 7 if (list[loc] == searchItem) //Line 8 return loc; //Line 9 else //Line 10 return -1; //Line 11 else //Line 12 return -1; //Line 13 }

30. Binary Search Algorithm (continued)

31. Binary Search Algorithm (continued) public static int binarySearch( int [] list, int listLength, int searchItem) { int first = 0; int last = listLength - 1; int mid; boolean found = false ; while (first <= last && !found) { mid = (first + last) / 2; if (list[mid] == searchItem) found = true ; else if (list[mid] > searchItem) last = mid - 1; else first = mid + 1; } if (found) return mid; else return –1; } //end binarySearch

32. Binary Search Algorithm (continued)

33. Binary Search Algorithm (continued)

34. Performance of the Binary Search

35. Performance of the Binary Search (continued)

39. Members of the class Vector

40. Members of the class Vector (continued)

41. Members of the class Vector (continued)

42. Members of the class Vector (continued)

43. Members of the class Vector (continued)

45. Vector<String> stringList = new Vector<String>(); stringList.addElement(&quot;Spring&quot;); stringList.addElement(&quot;Summer&quot;); stringList.addElement(&quot;Fall&quot;); stringList.addElement(&quot;Winter&quot;); Vectors (continued)

50. Programming Example: Election Results

51. Programming Example: Election Results (continued)

52. Additional String Methods

53. Additional String Methods (continued)

54. Additional String Methods (continued)

55. Additional String Methods (continued)

56. Effects of Some String Methods

59. Programming Example: Pig Latin Strings (Sample Runs)