For selection sort, how many comparisons would be needed to sort an array containing 100 elements if the original array elements were already sorted? What if the original array elements were sorted in reverse order? What if the original array elements were all identical?

Assume nums is an array of integers that looks like this: -3 12 9 0 2 -1 If we are sorting from smallest to largest, what will nums look like after 2 times through the outside loop if we are using bubble sort? Note: When you're entering the values, make sure you leave at least one space between them. Would it be possible to perform a linear search on a 2-D array? Answers: Yes, but you would be limited to using only one loop No, because a 2-D array is not stored in linear fashion in RAM Yes, as long as you used the proper nested loops No, you would have to use a binary search Yes, but only if the array's elements were sorted

Using selection sort, Sort the following array from greatest to least write down what the array AA and the sortedsorted array will look like at each step.

operation of insertion-sort on the array A= {31,41,59,26,41,58}

Define Selection Sort and Bubble Sort algorithms.  How would you sort the following array using selection and bubble sort algorithms.   What is the time complexity of each algorithms? a=[4, 2, 6, 5]

Compare the sorting times of the insertion sort with QuickSort using a small array (less than 20). What is the time difference? Could you explain why?