Strings (data structure): I know Suffix Array contruction in [math] O(n*log(n) *log(n)) [/math]. Now I am trying to learn DC3 algorithm for the same. Could anybody explain me how this algorithms works in linear time and also good implementation?
Data Structures: How do I prove that the expected height of a BST after n insertion is O(log n)?