tailieunhanh - Introduction to java programming: Chapter 23 - Algorithm Efficiency and Sorting

Introduction to java programming: Chapter 23 - Algorithm Efficiency and Sorting's Objectives is to estimate algorithm efficiency using the Big O notation; understand growth rates and why constants and smaller terms can be ignored in the estimation. | Chapter 23 Algorithm Efficiency and Sorting ---------Chapter 11 Object-Oriented Design Chapter 20 Lists Stacks Queues Trees and Heaps Chapter 21 Generics ___________________________ Chapter 22 Java Collections Framework__________ --------- Chapter 19 Recursion_____________ Chapter 23 Algorithm Efficiency and Sorting____ Liang Introduction to Java Programming Sixth Edition c 2005 Pearson Education Inc. All rights reserved. 0-13-148952-6 Objectives To estimate algorithm efficiency using the Big O notation . To understand growth rates and why constants and smaller terms can be ignored in the estimation . To know the examples of algorithms with constant time logarithmic time linear time log-linear time quadratic time and exponential time . To analyze linear search binary search selection sort and insertion sort . To design implement and analyze bubble sort . To design implement and analyze merge sort . To design implement and analyze quick sort . To design implement and analyze heap sort . To sort large data in a file . Liang Introduction to Java Programming Sixth Edition c 2005 Pearson Education Inc. All 2 rights reserved. 0-13-148952-6 2 why study sorting Sorting is a classic subject in computer science. There are three reasons for studying sorting algorithms. - First sorting algorithms illustrate many creative approaches to problem solving and these approaches can be applied to solve other problems. - Second sorting algorithms are good for practicing fundamental programming techniques using selection statements loops methods and arrays. - Third sorting algorithms are excellent examples to demonstrate algorithm performance. Liang Introduction to Java Programming Sixth Edition c 2005 Pearson Education Inc. All 3 rights reserved. .