[理工] [資結]-成大93-電機丁

看板Grad-ProbAsk作者IDontBite (IDontBite)時間16年前 (2010/01/29 16:38)推噓4(4推 0噓 7→)

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

What is(are) true for hashing? (A)Hashing can not be used as one sorting algorithm (B)Hashing always gives caonstant searching time (C)A hash table may be implemented using only array structure (D)The number of buckets in a hash table must be a prime number (E)It is possible to avoid collision and overflow without any overhead (F)None of the above 答案只有(A), 想問(C)選項為什麼錯呢? 假設是static hashing且用linear probing會用到其他structure嗎? -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 114.32.189.59

推

yesmilo

01/29 16:42, , 1^F

01/29 16:42, 1^F

推

qazwsxee

01/29 16:42, , 2^F

01/29 16:42, 2^F

→

IDontBite

01/29 16:44, , 3^F

01/29 16:44, 3^F