推 reader:selection sort 61.222.173.26 12/31
A group of numbered n people are seated on chairs randomly.
The chair are marked by C1,C2,C3....Cn. By swaping the seats
one to the first position, the group of n people can be seated
in order.
a) Find an algorithm that seats the people in order.
b) What is the most efficient way to seat the people in
order? Can recursion relation method work for this problem?
因為是這方面的新手，所以實在想不出怎麼解。有勞各位大大協助<(_ _)>
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.113.20.240