If a selection sort is used to arrange the numbers 7 5 3 9 2

If a selection sort is used to arrange the numbers 7 5 3 9 2 6 in ascending order, what order will the data be in after the first pass? 2 5 3 9 7 6 5 7 3 9 2 6 5 3 7 2 6 9 2 3 5 6 7 9 None of these We can measure the complexity of an algorithm that solve a computational problem by determining the number of _______ for an input of size 0. Output statements it has times it loops basic steps it requires variable it uses operations it performs The advantage of a linear search is that it is simple it is efficient it is last it can be used on unordered data both it is simple and it can be used on unordered data A sorting algorithm can be used to arrange a set of _____ in _____ order numeric values, ascending numeric values, descending strings, ascending strings, descending All of these If a bubble sort is used to arrange the numbers 7 5 3 9 2 6 in ascending order, what order will the data be in after the first pass? 2 5 3 5 7 6 5 7 3 9 2 6 5 3 7 2 6 5 2 3 5 6 7 9 None of these

Solution

Q3:
sol: both it is simple and it can be used on unordered data

Q4 :

sol: all of these( sorting algortihm works on integer and string also)

Q5: 7 5 3 9 2 6
sol: after first pass it elements is
5 3 7 2 6 9