[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

C++ dynamic arrays vs. linked lists

Published: 01 September 1996 Publication History

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++.

References

[1]
Borland C++ Version 3.1 User's Guide. Borland International, Inc. Scotts Valley, California. 1992.
[2]
Borland C++ Version 3.1 Library Reference. Borland International, Inc. Scotts Valley, California. 1992.
[3]
Horowitz, E., Sahni, S., Mehta, D., Fundamentals of Data Structures in C++. Computer Science Press. New York. 1995.
[4]
Pohl, Ira. C++ for Pascal Programmers Second Edition. The Benjamin/Cummings Publishing Company, Inc. Redwood City, California. 1994.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGCSE Bulletin
ACM SIGCSE Bulletin  Volume 28, Issue 3
Sept. 1996
68 pages
ISSN:0097-8418
DOI:10.1145/234867
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1996
Published in SIGCSE Volume 28, Issue 3

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 1,335
    Total Downloads
  • Downloads (Last 12 months)98
  • Downloads (Last 6 weeks)12
Reflects downloads up to 07 Jan 2025

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media