In this chapter you’ll:
Search for a given value in an array
using linear search and binary search.
Sort an array
using insertion sort, selection sort and the recursive merge sort algorithms.
Use Big O notation to express the efficiency of searching and sorting algorithms and to compare their performance.
Understand the nature of algorithms of constant, linear and quadratic runtime.