Consider the list of numbers (3, 6, 1, 2, 8). What is the smallest number of pairs that you could swap to put them in sorted order?
Answers
Answered by
0
Given : the list of numbers (3, 6, 1, 2, 8).
To Find : smallest number of pairs that you could swap to put them in sorted order?
Solution:
Two Swaps are needed
swap 1 with 3
and swap 2 with 6
(3, 6, 1, 2, 8).
swap 1 with 3
=> ( 1 , 6 , 3 , 2 , 8 )
swap 2 with 6
=> ( 1 , 2 , 3 , 6 , 8 )
Learn More:
Value of a two digits number when reversed is 6 less than twice its ...
brainly.in/question/17533064
The product of two 2 digit numbers is 1450. If the product of the ten's ...
brainly.in/question/18995250
Answered by
0
Answer:
2
Step-by-step explanation:
3,6 is one and 1,2 is another
Similar questions