*This preview shows
page 1. Sign up to
view the full content.*

**Unformatted text preview: **it in the language of his choice. The sorting algorithms we examine are insertion sort, which uses an incremental approach, and merge sort, which uses a recursive technique known as divide and conquer. Although the time each requires in-creases with the value of n , the rate of increase differs between the two algorithms. We determine these running times in Chapter 2, and we develop a useful notation to express them. Chapter 3 precisely denes this notation, which we call asymptotic notation. It starts by dening several asymptotic notations, which we use for bounding algo-rithm running times from above and/or below. The rest of Chapter 3 is primarily a presentation of mathematical notation. Its purpose is more to ensure that your use of notation matches that in this book than to teach you new mathematical concepts....

View Full
Document