Abstract
Dynamically allocated linked lists are generally portrayed as a more flexible structure than arrays. However, dynamically allocated arrays, as available in C++, can be just as flexible and easier to use. This paper compares the use of dynamically allocated linked lists to dynamically allocated arrays as available in C++.
- Borland C++ Version 3.1 User's Guide. Borland International, Inc. Scotts Valley, California. 1992.Google Scholar
- Borland C++ Version 3.1 Library Reference. Borland International, Inc. Scotts Valley, California. 1992.Google Scholar
- Horowitz, E., Sahni, S., Mehta, D., Fundamentals of Data Structures in C++. Computer Science Press. New York. 1995. Google Scholar
Digital Library
- Pohl, Ira. C++ for Pascal Programmers Second Edition. The Benjamin/Cummings Publishing Company, Inc. Redwood City, California. 1994. Google Scholar
Digital Library
Index Terms
C++ dynamic arrays vs. linked lists
Recommendations
Dynamic extended suffix arrays
The suffix tree data structure has been intensively described, studied and used in the eighties and nineties, its linear-time construction counterbalancing his space-consuming requirements. An equivalent data structure, the suffix array, has been ...
A search-free DOA estimation algorithm for coprime arrays
Recently, coprime arrays have been in the focus of research because of their potential in exploiting redundancy in spanning large apertures with fewer elements than suggested by theory. A coprime array consists of two uniform linear subarrays with inter-...
MultiArray: a C++ library for generic programming with arrays
Research ArticlesIn C++, multi-dimensional arrays are often used but the language provides limited native support for them. The language, in its Standard Library, supplies sophisticated interfaces for manipulating sequential data, but relies on its bare-bones C heritage ...






Comments