Data Structure and Algorithms
Introduction
Data Structure
Array
Linked Lists
Node Implementation
XOR Linked List
Storage Pool
Generalized List
Stacks & Queues
Stacks
Queues
Tree
Stackless Traversal
Searching
Linear Search
Binary Search
Fibonacci Search
Interpolation Search
Hashing
Asymptotic Analysis
Amortized Cost Analysis
Dynamic Programming
Matrix-chain Multiplication
Exponential Problems
Prime Problems
Recursion
Ackermann's Function
Combination
Recurrence Relations
Divide and Conquer
Powered by
GitBook
Interpolation Search
Interpolation Search
內插
特點
對隨機(uniform distribution)有極佳的效率,,通常可視為
對不平均分佈資料而言,效率差,worst case:
results matching "
"
No results matching "
"