作者pooq2004 (新世纪)
看板CSSE
标题请教一题演算法
时间Fri Dec 31 13:16:36 2004
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
1F：推 reader:selection sort 61.222.173.26 12/31