June 2017
Beginner
1296 pages
69h 23m
English
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 | |
| Insertion sort | Section 19.7 | |
| Merge sort | Section 19.8 | O(n log n) |
| Bubble sort | Exercises 19.5 and 19.6 | |
Searching and ...