Skip to Content
Java How to Program, Early Objects, 11th Edition
book

Java How to Program, Early Objects, 11th Edition

by Paul J. Deitel, Harvey Deitel
June 2017
Beginner
1296 pages
69h 23m
English
Pearson
Content preview from Java How to Program, Early Objects, 11th Edition

19.9 Big O Summary for This Chapter’s Searching and Sorting Algorithms

Figure 19.7 summarizes the searching and sorting algorithms covered in this chapter with the Big O for each. Figure 19.8 lists the Big O values we’ve covered in this chapter along with a number of values for n to highlight the differences in the growth rates.

Algorithm Location Big O
Searching Algorithms:
Linear search Section 19.2 O(n)
Binary search Section 19.4 O(log n)
Recursive linear search Exercise 19.8 O(n)
Recursive binary search Exercise 19.9 O(log n)
Sorting Algorithms:
Selection sort Section 19.6 O(n2)
Insertion sort Section 19.7 O(n2)
Merge sort Section 19.8 O(n log n)
Bubble sort Exercises 19.5 and 19.6 O(n2)

Fig. 19.7

Searching and ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Beginning Java 17 Fundamentals: Object-Oriented Programming in Java 17

Beginning Java 17 Fundamentals: Object-Oriented Programming in Java 17

Kishori Sharan, Adam L. Davis
Learning Java, 5th Edition

Learning Java, 5th Edition

Marc Loy, Patrick Niemeyer, Daniel Leuck
Java in a Nutshell, 8th Edition

Java in a Nutshell, 8th Edition

Benjamin J. Evans, Jason Clark, David Flanagan

Publisher Resources

ISBN: 9780134751962