In: Computer Science
|
index |
1 |
2 |
3 |
4 |
5 |
6 |
|
data |
11 |
10 |
21 |
3 |
7 |
5 |
Ans:
Given that: Sorting sort searches the smallest element and places the top index in an unsorted array.
|
index |
1 |
2 |
3 |
|
data |
11 |
10 |
22 |
Step 1:
(a)
|
index |
1 |
2 |
3 |
|
data |
11 |
10 |
22 |
|
Min value |
11 |
Index 1 |
(b)
|
index |
1 |
2 |
3 |
|
data |
11 |
10 |
22 |
|
Min value |
11 |
Index 2 compare value with min value |
Min value 10 |
(c)
|
index |
1 |
2 |
3 |
|
data |
11 |
10 |
22 |
|
Min value |
10 |
Index 3 compare value with min value |
Swap index 2 value by 1 |
|
index |
1 |
2 |
3 |
|
data |
10 |
11 |
22 |
|
Index 1 value is sorted |
Step 2:
(a)
|
index |
1 |
2 |
3 |
|
data |
10 |
11 |
22 |
|
Min value |
11 |
Index 2 |
(b)
|
index |
1 |
2 |
3 |
|
data |
10 |
11 |
22 |
|
Min value |
11 |
Index 3 compare value with min value |
No swapping |
|
index |
1 |
2 |
3 |
|
data |
10 |
11 |
22 |
|
Till Index 2 value is sorted |
Step 3:
(a)
|
index |
1 |
2 |
3 |
|
data |
10 |
11 |
22 |
|
Min value |
22 |
Index 3 |
Now sorted Array
|
index |
1 |
2 |
3 |
|
data |
10 |
11 |
22 |