BROWN HASH

Need help with Algorithm Analysis?

what’s the avg and worst case running times for operations find, insert, and delete for arrays (sorted, unsorted), linked lists (sorted, unsorted), Binary Search Trees, AVL-trees, B-trees of order m, Hash tables, and Red-Black trees.

All of the answers can be found in any good book on algorithms, e.g. Cormen – you just have to do a little reading.