java chapter培训讲义.pptVIP

* 16.4 Invariants(不变式) Loop invariant remains true: Before the execution of the loop After every iteration of the loop body When the loop terminates * 16.4 Invariants Four steps to developing a loop from a loop invariant Set initial values for any loop control variables Determine the condition that causes the loop to terminate Modify the control variable so the loop progresses toward termination Check that the invariant remains true at the end of each iteration * Outline BinarySearchTest.java (3 of 3) * Efficiency of Binary Search Binary search Each comparison halves the size of the remaining array Results in O(log n) Called logarithmic run time * 16.3 Sorting Algorithms Sorting data Placing data into some particular order A bank sorts checks by account number Telephone companies sort accounts by name End result is always the same – a sorted array Choice of algorithm affects how you achieve the result and, most importantly, how fast you achieve the result * 16.3.1 Selection Sort Selection sort Simple, but inefficient sorting algorithm First iteration selects smallest element in array and swaps it with the first element Each iteration selects the smallest remaining unsorted element and swaps it with the next element at the front of the array After i iterations, the smallest i elements will be sorted in the first i elements of the array * Outline SelectionSort.java (1 of 3) Variable to store index of smallest element Loop length – 1 times * Outline SelectionSort.java (2 of 3) Loop over remaining elements Locate smallest remaining element Swap smallest element with first unsorted element * Outline SelectionSort.java (3 of 3) * Outline SelectionSortTest.java (1 of 2) * Outline SelectionSortTest.java (2 of 2) * Efficiency of Selection Sort Selection sort Outer for loop iterates over n – 1 elements Inner for loop iterates over remaining elements in the array Results in O(n2) * 16.3.2 Insertion Sort Insertion sort Another simple, but inefficient sorting algorithm