In this paper we prove that if the nodes of an arbitrary no-node binary search tree T are splayed in the preorder sequence of T then the total time is O(n). This is a special case of the splay treeâ€¦ (More)

It has been proved that when the production probabilities of an unambiguous context-free grammar G are estimated by the relative frequencies of the corresponding productions in a sample S from theâ€¦ (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â€¦ (More)

We present a simple linear time algorithm for generating a worst case sequence for Quicksort when the pivot element is chosen as the middle elements of the (sub)array in each pass.

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â€¦ (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â€¦ (More)