A dynamic strategy for multiple stacks manipulation

A new method for manipulating multiple stacks based on a dynamic data structure is proposed. By using a simple data structure called ordered-heap, it is easy to simultaneously handle several variable-size stacks in a sequential area of memory. The performance of this method is much better than D. E. Knuth´s (1973) method and Garwick´s method. For instance, there are 10 stacks and memory size is 500. Improvement of the author´s method will be approximately 2.5 times that of Garwick´s and much more than this compared to Knuth´s when a load factor of 80% is achieved. In addition, the method described has a stable performance whatever n and m are