One DT represents the comparisons needed by a given sorting algorithm to sort all possible all possible orderings of n elements What is longest path for quicksort? mergesort?

Chapter Objectives Examine the linear search and binary search algorithms Examine several sorting algorithms, including: selection sort insertion sort bubble sort quick sort merge sort Discuss the …

Format Slide 27 of 31

sites.radford.edu

sites.radford.edu

Describe and answer questions about example divide and conquer algorithms Binary Search Quick Sort Merge Sort Integer Multiplication Matrix Multiplication (Strassen's algorithm) Maximal Subsequence

sites.radford.edu

sites.radford.edu

sites.radford.edu

sites.radford.edu