作者wind1227 (wind)
看板Grad-ProbAsk
標題[問題] 97北大離散
時間Thu Mar 26 14:49:07 2009
Let X = {1, 2, 3, …, 9}. Algorithm A lists all 6-permutations of X in
increasing lexicographic order. Algorithm B prints all 6-combinations of X in
increasing lexicographic order where each combination is
printed as an increasing sequence.
(a) Find the permutation that will be generated by algorithm A after the
permutation 421987.
(b) Find the combination that will be generated by algorithm B after the
combination 124789.
可以請問一下這題的答案嗎??
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 125.232.98.221
1F：→ wind1227:排列和組合的方式 又差在哪邊...? 03/26 14:56