Program efficiency and data structures

Authors:
Moshe Augenstein;Aaron Tenenbaum
Affiliations:
Department of Computer & Information Science, Brooklyn College, Brooklyn, New York;Department of Computer & Information Science, Brooklyn College, Brooklyn, New York
Venue:
SIGCSE '77 Proceedings of the eighth SIGCSE technical symposium on Computer science education
Year:
1977

Citing 2
Cited 3

An introduction to data structures with applications (2nd ed.)

An introduction to data structures with applications (2nd ed.)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

An applied computer science/systems programming approach to teaching data structures

SIGCSE '79 Proceedings of the tenth SIGCSE technical symposium on Computer science education
Programming the Josephus problem

ACM SIGCSE Bulletin
The Josephus Flavius' problem

ACM SIGCSE Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

Program efficiency is usually considered from the point of view of optimizing code. Selecting a proper data structure can have a remarkable effect on the efficiency of the final program. In this paper it is shown how one problem can be solved in several ways using several different data structures. The efficiency of the programs depend on the data structures selected.