Programming Lecture 10

Java Programming: From Problem Analysis to Program Design, 3e
Chapter 10 Applications of Arrays (Searching and Sorting) and Strings
Chapter Objectives
Learn how to implement the sequential search algorithm Explore how to sort an array using bubble sort, selection sort, and insertion sort algorithms Learn how to implement the binary search algorithm Become aware of the class Vector Learn more about manipulating strings using the class String
Java Programming: From Problem Analysis to Program Design, 3e 2
List Processing
List: a set of values of the same type Basic operations performed on a list
Search list for given item Sort list Insert item in list Delete item from list
Search
Necessary components to search a list
Array containing the list Length of the list Item for which you are searching
After search completed

If item found, report success, return location in array If item not found, report failure
Search (continued)
Suppose that you want to determine whether 27 is in the list First compare 27 with list[0]; that is, compare 27 with 35 Because list[0] 27, you then compare 27 with list[1] Because list[1] 27, you compare 27 with the next element in the list Because list[2] = 27, the search stops This search is successful
Search (continued)
Lets now search for 10 The search starts at the first element in the list; that is, at list[0] Proceeding as before, we see that this time the search item, which is 10, is compared with every item in the list Eventually, no more data is left in the list to compare with the search item; this is an unsuccessful search
Search (continued)
Search (continued)
Search (continued)
Using a while (or a for) loop, the definition of the method seqSearch can also be written without the break statement as:
Sorting a List
Bubble sort
Suppose list[0...n - 1] is a list of n elements, indexed 0 to n - 1 We want to rearrange; that is, sort, the elements of list in increasing order The bubble sort algorithm works as follows:
In a series of n - 1 iterations, the successive elements, list[index] and list[index + 1] of list are compared If list[index] is greater than list[index + 1], then the elements list[index] and list[index + 1] are swapped, that is, interchanged
Bubble Sort
11
Bubble Sort (continued)
12
13

It is known that for a list of length n, on average bubble sort makes n(n 1) / 2 key comparisons and about n(n 1) / 4 item assignments Therefore, if n = 1000, then to sort the list bubble sort makes about 500,000 key comparisons and about 250,000 item assignments
Selection Sort
List is sorted by selecting list element and moving it to its proper position Algorithm finds position of smallest element and moves it to top of unsorted portion of list Repeats process above until entire list is sorted
Selection Sort (continued)
16
17

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; } }

It is known that for a list of length n, on an average selection sort makes n(n 1) / 2 key comparisons and 3(n 1) item assignments Therefore, if n = 1000, then to sort the list selection sort makes about 500,000 key comparisons and about 3000 item assignments
19
Insertion Sort
The insertion sort algorithm sorts the list by moving each element to its proper place
20
Insertion Sort (continued)
21
22
23

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

It is known that for a list of length n, on average, the insertion sort makes (n2 + 3n 4) / 4 key comparisons and about n(n 1) / 4 item assignments Therefore, if n = 1000, then to sort the list, the insertion sort makes about 250,000 key comparisons and about 250,000 item assignments
25
Sequential Ordered Search

public static int seqOrderedSearch(int[] list, int listLength, int searchItem) { int loc; boolean found = false; for (loc = 0; loc < listLength; loc++) if (list[loc] >= searchItem) { found = true; break; } if (found) if (list[loc] == searchItem) return loc; else return -1; else return -1; }
//Line //Line //Line //Line
1 2 3 4
//Line 5 //Line 6
//Line //Line //Line //Line //Line //Line //Line
7 8 9 10 11 12 13
26
Binary Search
Can only be performed on a sorted list Uses divide and conquer technique to search list
27
Binary Search Algorithm

Search item is compared with middle element of list If search item < middle element of list, search is restricted to first half of the list If search item > middle element of list, search second half of the list If search item = middle element, search is complete
Binary Search Algorithm (continued)

Determine whether 75 is in the list
29
30

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
33
Performance of the Binary Search
34
Performance of the Binary Search (continued)
35

Suppose that L is a list of size 1000000 Since 1000000 } 1048576 = 220, it follows that the while loop in binary search will have at most 21 iterations to determine whether an element is in L Every iteration of the while loop makes two key (that is, item) comparisons

To determine whether an element is in L, binary search makes at most 42 item comparisons
On the other hand, on average, a sequential search will make 500,000 key (item) comparisons to determine whether an element is in L
In general, if L is a sorted list of size n, to determine whether an element is in L, the binary search makes at most 2log2n + 2 key (item) comparisons
Vectors
The class Vector can be used to implement a list Unlike an array, the size of a Vector object can grow/shrink during program execution You do not need to worry about the number of data elements in vector
38
Members of the class Vector
39
Members of the class Vector (continued)
40
41
42
43
Vectors (continued)
Every element of a Vector object is a reference variable of the type Object To add an element into a Vector object
Create appropriate object Store data into object Store address of object holding data into Vector object element
Vectors (continued)
Vector<String> stringList = new Vector<String>(); stringList.addElement("Spring"); stringList.addElement("Summer"); stringList.addElement("Fall"); stringList.addElement("Winter");
45
Programming Example: Election Results

Input: two files
File 1: candidates names File 2: voting data
Voting Data Format

candidate_name region# number_of_votes_for_this_candidate
46
Programming Example: Election Results (continued)

Output: election results in a tabular form
Each candidates name Number of votes each candidate received in each region Total number of votes each candidate received
47
Programming Example: Election Results (Solution)

The solution includes:
Reading the candidates names into the array candidateName A two-dimensional array consisting of the votes by Region An array consisting of the total votes parallel to the candidateName array
48
Programming Example: Election Results (Solution) (continued)

The solution includes (continued):
Sorting the array candidatesName Processing the voting data Calculating the total votes received by each candidate Outputting the results in tabular form
49
Programming Example: Election Results
50
Programming Example: Election Results (continued)
51
Additional String Methods
52
Additional String Methods (continued)
53
54
55
Effects of Some String Methods
56
Programming Example: Pig Latin Strings

If string begins with a vowel, -way is appended to it If first character is not a vowel:
Add - to end Rotate characters until the first character is a vowel Append ay
Input: string Output: string in pig Latin

Programming Example: Pig Latin Strings (Solution)

Methods: isVowel, rotate, pigLatinString Use methods to:
Get the string (str) Find the pig Latin form of str by using the method pigLatinString Output the pig Latin form of str
58
Programming Example: Pig Latin Strings (Sample Runs)
59
Chapter Summary
Lists Searching lists
Sequential searching Sequential searching on an order list Binary Search
Sorting lists
Bubble Sort Selection Sort Insertion Sort
Chapter Summary (continued)

Programming examples The class Vector
Members of the class Vector
The class String

Additional methods of the class String
61

Programming Lecture 10

Diunggah oleh

Informasi Dokumen

Deskripsi Asli:

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

Programming Lecture 10

Diunggah oleh

Hak Cipta:

Format Tersedia

Java Programming: From Problem Analysis to Program Design, 3e

Chapter 10 Applications of Arrays (Searching and Sorting) and Strings

Java Programming: From Problem Analysis to Program Design, 3e

After search completed

Java Programming: From Problem Analysis to Program Design, 3e

Java Programming: From Problem Analysis to Program Design, 3e

Java Programming: From Problem Analysis to Program Design, 3e

Java Programming: From Problem Analysis to Program Design, 3e

Bubble Sort (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Bubble Sort (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Bubble Sort (continued)

Selection Sort (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Selection Sort (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Selection Sort (continued)

Selection Sort (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Java Programming: From Problem Analysis to Program Design, 3e

Insertion Sort (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Insertion Sort (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Insertion Sort (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Insertion Sort (continued)

Insertion Sort (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Sequential Ordered Search

//Line //Line //Line //Line

//Line //Line //Line //Line //Line //Line //Line

Java Programming: From Problem Analysis to Program Design, 3e

Binary Search Algorithm

Binary Search Algorithm (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Binary Search Algorithm (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Binary Search Algorithm (continued)

Binary Search Algorithm (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Binary Search Algorithm (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Performance of the Binary Search

Java Programming: From Problem Analysis to Program Design, 3e

Performance of the Binary Search (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Performance of the Binary Search (continued)

Performance of the Binary Search (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Members of the class Vector

Java Programming: From Problem Analysis to Program Design, 3e

Members of the class Vector (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Members of the class Vector (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Members of the class Vector (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Members of the class Vector (continued)

Java Programming: From Problem Analysis to Program Design, 3e

Java Programming: From Problem Analysis to Program Design, 3e

Programming Example: Election Results