The worst case analysis of algorithm on multiple stacks manipulation (Q1201875): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5585020 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(92)90194-z / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2052430277 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:13, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The worst case analysis of algorithm on multiple stacks manipulation |
scientific article |
Statements
The worst case analysis of algorithm on multiple stacks manipulation (English)
0 references
17 January 1993
0 references
System developers frequently encounter programs which involve multiple stacks, each of which has dynamically varying size. In such a situation, keeping multiple stacks in a common area with sequential allocation with cause some trouble. A number of possible solutions for overflow have been suggested. \textit{D. E. Knuth} proposed a simple solution in reallocating memory by move operations [The art of computer programming. Vol. 1: Fundamental algorithms (1968; Zbl 0191.179)]. The method will be described in detail in the next section. He also analyzed the average number of movements when overflow occurs and got a formula concerning the number of stacks and pushed items. Here, we focus on the worst sequence of pushed data instead of the individual worst case, getting some interesting properties.
0 references
analysis of algorithms
0 references
data structures
0 references
multiple stacks
0 references
overflow
0 references
reallocating memory
0 references