Learn More
The paper presents a number of elementary examples which could be used to teach the concept of bit-level algorithm analysis to the undergraduate students in Computer Science. Each of these example algorithms take one or more integer(s) as input in order to output the result. Without a bit-level analysis, the run-time complexities of these algorithms can not(More)
A form of self-adjusting binary search tree, called the splay tree, has been studied by Sleator and Tarjan [1]. On any sufficiently long access sequence, a splay tree has been shown to be as efficient as both dynamically balanced and static optimum search trees. Sleator and Tarjan have even made a much stronger conjecture; namely, that on any sufficiently(More)
  • 1