Given an array of 6 numbers [6,8,19,48,9,90]and applying insertion sort, how many swaps must occur before the array is sorted?1 point42 6

[20, 62, 71, 85, 86, 61] Give me the number of comparisons and swaps for the above list, following insertion sort algorithm.

Given list [16, 32, 35, 99, 37, 42, 67, 88, 68], how many swaps are needed to sort the list?

Assume we want to sort integers into ascending order. To sort a small array that contains 42, 17, selection sort will perform one swap, or three assignments. How many assignments will it perform to sort an array that contains these 10 elements: 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 ? Group of answer choices 15 18 24 27 63

Assume we want to sort integers into ascending order. To sort a small array that contains 42, 17, insertion sort will perform three assignments. How many assignments will insertion sort perform to sort an array that contains these 10 elements: 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 ? Group of answer choices 15 18 24 55 63

What will be the number of passes to sort the elements using insertion sort?14, 12,16, 6, 3, 106571