Schnee124

摘要： 竞争性分析、自组织表 Self-organizing lists List L of n elems Operation Access(x),costs rank(x) = distace of x from head of L L can be reorder by transposing adj 阅读全文

摘要： 平摊分析、表的扩增、势能方法 hash表需要多大？ 越大越好(time) 尽可能小(space ) $\Theta $(n) for n items Problem :don't know n? Solution: dynamic tables overflow ⇒ grow it 1.Reallo 阅读全文