[問題] 演算法

看板Programming作者yaote (ted)時間17年前 (2007/01/13 11:16)推噓4(4推 0噓 0→)

留言4則, 1人參與討論串1/6 (看更多)

以下是一所國外研究所的考試題目，是否能用程式跟圖解來解答這個問題? I have a computer file containing 1,000,000 non-negative integers, in no particular order. Imagine that they are the membership numbers of people who are enrolled in my internet club. A new person wants to join the club, and we need to find an unused number to allocate to them. How would you find, in a reasonable time, a number that was not already in the file? -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 220.140.56.26

推

march20

01/13 11:58, , 1^F

01/13 11:58, 1^F

推

march20

01/13 11:59, , 2^F

01/13 11:59, 2^F

推

march20

01/13 11:59, , 3^F

01/13 11:59, 3^F