[理工] [計概]-中興97-網媒所
(1)Give a set of 1024 distinct key,what is the worst case number of comparisons
required by the most efficient algorithn to search some specific key if
these key are stored in a linked list with key sorted from the smallest to
the largest?
What id the worst case number of comparisons if we have three additional
pointers pointing to the 256^th,the 512^th and the 768^th key?
(2)A B-tree of order m is an m-way search tree that either is empty or satisfies
the following three properties:
(1)The root node has at least two children
(2)All nodes other than the root node and external nodes have a property.
What is the property?
(3)All external nodes have a property.What is the property?
這兩題可以請大大幫我解一下嗎
我連題目都看不太懂 糟糕
--
一切....
似乎不再那麼重要....
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.46.160.125
推
02/22 11:46, , 1F
02/22 11:46, 1F
→
02/22 11:47, , 2F
02/22 11:47, 2F
推
03/08 16:37, , 3F
03/08 16:37, 3F
→
03/08 16:38, , 4F
03/08 16:38, 4F
推
03/11 01:42, , 5F
03/11 01:42, 5F
討論串 (同標題文章)
完整討論串 (本文為第 2 之 2 篇)：