CMPS 3120 Algorithm Analysis
Transform and Conquer
- checking if all elements are distinct
- computing the median
Searching Problem: Given a (multi)set S of keys and a search key K, find an occurrence of K in S, if any
Solution(heap)
Solution(2-3 tree)
Solution(AVL tree)