Chapter 10 Objectives After you have read and studied this chapter, you should be able to e Perform linear and binary search algorithms on small arrays. e Determine whether a linear or binary search is more effective for a given situation Perform selection and bubble sort algorithms e Describe the heapsort algorithm and show how its performance is superior to the other two algorithms e Apply basic sorting algorithms to sort an array of objects C 2000 McGraw-Hill Introduction to Object-Oriented Programming with Java--Wu Chapter 10-2© 2000 McGraw-Hill Introduction to Object-Oriented Programming with Java--Wu Chapter 10 - 2 Chapter 10 Objectives After you have read and studied this chapter, you should be able to Perform linear and binary search algorithms on small arrays. Determine whether a linear or binary search is more effective for a given situation. Perform selection and bubble sort algorithms. Describe the heapsort algorithm and show how its performance is superior to the other two algorithms. Apply basic sorting algorithms to sort an array of objects