Java™ How to Program, Seventh Edition

16.5. Wrap-Up

This chapter introduced searching and sorting. We discussed two searching algorithms— linear search and binary search—and three sorting algorithms—selection sort, insertion sort and merge sort. We introduced Big O notation, which helps you analyze the efficiency of an algorithm. You also learned about loop invariants, which must remain true before the loop begins executing, while the loop executes and when the loop terminates. In the next chapter, you’ll learn about dynamic data structures that can grow or shrink at execution time.