java语言程序设计-基础篇--课件(第20章)英文.ppt

Think Recursively Many of the problems presented in the early chapters can be solved using recursion if you think recursively. For example, the palindrome problem in Listing 7.1 can be solved recursively as follows: * public static boolean isPalindrome(String s) { if (s.length() = 1) // Base case return true; else if (s.charAt(0) != s.charAt(s.length() - 1)) // Base case return false; else return isPalindrome(s.substring(1, s.length() - 1)); } Recursive Helper Methods The preceding recursive isPalindrome method is not efficient, because it creates a new string for every recursive call. To avoid creating new strings, use a helper method: * public static boolean isPalindrome(String s) { return isPalindrome(s, 0, s.length() - 1); } public static boolean isPalindrome(String s, int low, int high) { if (high = low) // Base case return true; else if (s.charAt(low) != s.charAt(high)) // Base case return false; else return isPalindrome(s, low + 1, high - 1); } Recursive Selection Sort Find the largest number in the list and swaps it with the last number. Ignore the last number and sort the remaining smaller list recursively. * RecursiveSelectionSort Recursive Binary Search Case 1: If the key is less than the middle element, recursively search the key in the first half of the array. Case 2: If the key is equal to the middle element, the search ends with a match. Case 3: If the key is greater than the middle element, recursively search the key in the second half of the array. * RecursiveBinarySort Recursive Implementation /** Use binary search to find the key in the list */ public static int recursiveBinarySearch(int[] list, int key) { int low = 0; int high = list.length - 1; return recursiveBinarySearch(list, key, low, high); } ? /** Use binary search to find the key in the list between list[low] list[high] */ public static int recursiveBinarySearch(int[] list, int key, int low, int high) { if (low high) // The list ha