Gra 9.00 out of 10.00 de (90%) ???? Question 1 Question text The best asymptotic analysis for the selection sort is represented by (select the best option): Option 1. O( n log n ) Option 2. Q( n2) Option 3. O( n2) Option 4. O( n2 ) Question 1 Select one: a. Option 1 b. Option 2 C. Option 3 d. Option 4 Feedback The correct answer is: Option 4 Question 2 Question text A sort algorithm that uses two nested loops with the inner loop moving through the array from bottom to top is called the: Question 2 Select one: a. Insertion sort b. Bubble sort
C. Inversion sort d. Selection sort Feedback The correct answer is: Bubble sort Question 3 Question text A sort that features a limit of n-1 of record swaps is called: Question 3 Select one: a. Insertion sort b. Bubble sort C. Inversion sort d. Selection sort Feedback The correct answer is: Selection sort Question 4 Question text An exchange sort is one where: (select the best answer) Question 4 Select one: a. Records in an unsorted list are moved to a sorted list b. c. Adjacent records in the list and compared and exchanged An inversion is executed d. ----
The sorting algorithm is said to be stable Feedback The correct answer is: Adjacent records in the list and compared and exchanged Question 5 Question text A sort where the list is divided into halves, the halves sorted and these two halves are merged is called: Question 5 Select one: a. Mergesort b. Binary sort C. Quicksort d. Heapsort Feedback The correct answer is: Mergesort Question 6 Question text The benefit of a quicksort is that it provides excellent performance in both the average and worst case: Question 6 Select one: True False Feedback The correct answer is 'False'. Question 7 Question text ----