n selection sort, after each pass through the array, what is guaranteed about the elements at the beginning of the array?a.They are sortedb.They remain unchangedc.They are in reverse orderd.They are randomly rearranged

1 pointHow does Bubble Sort compare elements in an array? Compares adjacent elements and swaps if they are in the wrong order Compares random elements in the array Compares all elements with the first element Compares elements in reverse order

The selection sort algorithm sorts a list of values by repeatedly putting a particular value into its final, sorted position. A. True B. False

In insertion sort, if an element is smaller than the previous element, what action does the algorithm take?a.Moves the element to the end of the arrayb.Ignores the elementc.Swaps the element with the previous oned.Leaves the element as it is

Which sorting algorithm is based on the principle of repeatedly selecting the minimum element from the unsorted part of the array and placing it in its correct position?Group of answer choicesSelection SortMerge SortBubble SortInsertion Sort

Write a program to implement the Selection Sort algorithm to sort an array of integers in ascending order.Input:91 3 5 7 9 2 4 6 8Output:1 2 3 4 5 6 7 8 9Explanation:Initially, the minimum element in the array is 1. It is swapped with the first element, resulting in the array [1, 3, 8, 2, 5, 4]. Next, the minimum element in the remaining unsorted part is 2. It is swapped with the second element, resulting in [1, 2, 8, 3, 5, 4]. This process continues, and the final sorted array is [1, 2, 3, 4, 5, 8].