6篇文章 · 4176字 · 2人关注
-
master theorem 推导
Let a and b > 1 be constants, let f(n) be a function, and let T(n) be de...
-
11.扩充的数据结构、动态有序统计和区间树Augmenting data structures Dynamic order statistics OS-Select(i) - retur...
-
10. 平衡搜索树Goal: get a search tree data structure that we can insert, delete and se...
-
Binary Search Tree的Insert和Delete
Insert and delete insert 的整个思路很简单。其实只能加在最下面。所以从root开始，每次比较当前node的值和需要ins...
-
9. 二叉搜索树Tree insert: searchs for that element A[i]Tree walk: Theorem: E[height o...
-
8. 全域哈希和完全哈希
A fundamental weakness of hashing:For any choice of hash function, there...
文集作者