Recursion

More documents

Recommendations

Info

Efficiency of Binary Search and the Comparable Interface • At each recursive call we eliminate half the array elements from consideration • O(log 2 n) • Classes that implement the Comparable interface must define a compareTo method that enables its objects to be compared in a standard way • CompareTo allows one to define the ordering of elements for their own classes
Method Arrays.binarySearch • Java API class Arrays contains a binarySearch method • Can be called with sorted arrays of primitive types or with sorted arrays of objects • If the objects in the array are not mutually comparable or if the array is not sorted, the results are undefined • If there are multiple copies of the target value in the array, there is no guarantee which one will be found • Throws ClassCastException if the target is not comparable to the array elements
Page 1 and 2: Recursion Chapter 7
Page 3 and 4: Chapter Objectives (continued) •
Page 5 and 6: Recursive Thinking
Page 7 and 8: String Length Algorithm
Page 9 and 10: Tracing a Recursive Method
Page 11 and 12: Recursive Factorial Method
Page 13 and 14: Recursion Versus Iteration • Ther
Page 15 and 16: Efficiency of Recursion • Recursi
Page 17 and 18: An O(n) Recursive Fibonacci Method
Page 19 and 20: Efficiency of Recursion: O(n) Fibon
Page 21 and 22: Algorithm for Recursive Linear Arra
Page 23 and 24: Design of a Binary Search Algorithm
Page 25 and 26: Design of a Binary Search Algorithm
Page 27: Implementation of a Binary Search A
Page 31 and 32: Recursive Definition of a Linked Li
Page 33 and 34: Recursive toString Method
Page 35 and 36: Recursive Add Method
Page 37 and 38: Recursive Remove Method (continued)
Page 39 and 40: Towers of Hanoi
Page 41 and 42: Algorithm for Towers of Hanoi
Page 43 and 44: Algorithm for Towers of Hanoi (cont
Page 45 and 46: Implementation of Recursive Towers
Page 47 and 48: Counting Cells in a Blob (continued
Page 49 and 50: Implementation
Page 51 and 52: Counting Cells in a Blob (continued
Page 53 and 54: Backtracking (continued) • Never
Page 55 and 56: Recursive Algorithm for Finding Maz
Page 57 and 58: Implementation (continued)
Page 59 and 60: Chapter Review • A recursive meth

Recursion

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?