Answer:
<em>D Lan</em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em>
Answer:
Sorted array will be:-
3 5 5 9
Explanation:
In Selection Sort algorithm it sorts the array by repeatedly finds the minimum in the array form the array that is unsorted and swaps it with the value at the first position.
The unsorted array:- 5 3 9 5
In first iteration
minimum is 3.
3 will be swapped with 5.
Now the array is 3 5 9 5
sorted array 3
In second iteration
unsorted array is 5 9 5
sorted array 3 5
and the minimum from it is 5
No swapping will occur.
In third iteration
unsorted array is 9 5
minimum is 5
sorted array 3 5 5
swap it with 9.
Now the array is sorted.
3 5 5 9
Answer:
b.used is 2, b.data[0] is 4, b.data[1] is 6
Explanation:
bag b;
b.insert(5); // b has 5
b.insert(4); // b has 5,4
b.insert(6); // b has 5,4,6
b.erase_one(5); // now 5 is removed , b has 4,6
so no:of elements b.used is 2
b[0]=4;
b[1]=6;
