Abstract
Memory reallocation is used to construct a run-time data structure for fast/efficient storage of information during collection and analysis. The data structure presented uses dynamic memory but does not require the use of pointers to link nodes of information together. It allows for simple and efficient access to data via array indexing rather than through the use of lists or tree structures and it provides flexibility for competing storage requirements that are determined dynamically. The data structure is developed in the C programming language and a suite of ANSI standard C subroutines that make up a run-time data structure management system is provided.
Original language | English |
---|---|
Pages (from-to) | 85-92 |
Number of pages | 8 |
Journal | Computer Methods and Programs in Biomedicine |
Volume | 37 |
Issue number | 2 |
DOIs | |
Publication status | Published - Mar 1992 |
Keywords
- data structures
- dynamic memory
- extendible arrays
- record organization