7.9 Lab Sorting Tv Shows

Question: A (sort) pass is the movement of one element from the unsorted to sorted sublist
Answer: True
==================================================
Question: The selection sort will identify one value in the unsorted sublist to move and become part of the sorted sublist
Answer: True
==================================================
Question: The bubble sort operates faster when moving the larger values to the highest index than when moving the smaller values towards index zero
Answer: False
==================================================
Question: The insertion sort takes a value from the unsorted sublist and inserts it into the proper location of the sorted sublist based on the values currently present in the sorted sublist
Answer: True
==================================================
Question: Values once placed in the sorted sublist of the insertion sort are subject to be moved again as the algorithm progresses
Answer: True
==================================================
Question: To sort an array of N elements a N-1 sort passes are required to guarantee that data always ends in a sorted state
Answer: True
==================================================
Question: The outer loop in each of the three sorting algorithms is responsible for ensuring the number of passes required are completed
Answer: True
==================================================
Question: The selection sorting algorithm will complete one exchange involving at most two elements per pass.
Answer: True
==================================================
Question: The bubble sorting algorithm will complete one exchange involving at most two elements per pass
Answer: True
==================================================
Question: The insertion sorting algorithm will complete one exchange involving at most two elements per pass
Answer: False (one element/pass)
==================================================
Question: The selection sorting algorithm can only be used to sort data in ascending order (smallest to largest)
Answer: False
==================================================
Question: On the final pass through the selection sorting algorithm two values are brought over from unsorted list into sorted list
Answer: True
==================================================
Question: It is possible that during a single pass of the selection sorting algorithm that the order of the data in the array will be the same as It was after the previous pass
Answer: True
==================================================
Question: The bubble sorting algorithm compares neighboring elements in the unsorted list of the array and swaps their positions when they are not in the desired order
Answer: True
==================================================
Question: The bubble sorting algorithm is optimized to stop the process when the array is detected as being sorted.
Answer: False
==================================================
Question: Once the insertion sort places a value in the sorted list that value will never move again in the remainder of the passes.
Answer: False
==================================================
Question: The insertion sorting algorithm begins with one value in the sorted list before the first pass.
Answer: True
==================================================