CSCE 121 Chapter Notes - Chapter 18: Pivot Table, Bubble Sort, Binary Search Algorithm
3 Mar 2019
School
Department
Course
Professor
Document Summary
True/false: the sequential search algorithm does not require that the list be sorted. Ref: 1225: in a binary search, first, the search item is compared with the last element of the list. Pts: 1: the binary search algorithm can be written iteratively or recursively. Ref: 1229: in a bubble sort, the smaller elements move toward the bottom, and the larger elements move toward the top of the list. Ref: 1243: the selection sort algorithm finds the location of the smallest element in the unsorted portion of the list. Ref: 1248: during the second iteration of a selection sort, the smallest item is moved to the top of the list. Ref: 1249: if n = 1000, then to sort the list, selection sort makes about 50,000 key comparisons. Ref: 1250: during the sorting phase of insertion sort, the array containing the list is divided into two sublists, sorted and unsorted.
