- Full text PDF available (0)
- This year (0)
- Last 5 years (0)
- Last 10 years (0)
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)
The paper emphasizes the need for exposing the undergraduate computer science students to the bit-level analysis of the run-times of certain computer algorithms. These are algorithms where the input(s) consist of one or more integers and only a bit-level analysis yields a more realistic estimate of the run-time behaviors of such algorithms.
A form of self-adjusting binary search tree, called the splay tree, has been studied by Sleator and Tarjan . 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)