Data Structures and Algorithm Analysis
Year: 2018
Type: book
Abstract: We study data structures so that we can learn to write more efficient programs. \nBut why must programs be efficient when new computers are faster every year? \nThe reason is that our ambitions grow with our capabilities. Instead of rendering \nefficiency needs obsolete, the modern revolution in computing power and storage \ncapability merely raises the efficiency stakes as we attempt more complex tasks. \nThe quest for program efficiency need not and should not conflict with sound \ndesign and clear coding. Creating efficient programs has little to do with ???programming \ntricks??? but rather is based on good organization of information and good algorithms. \nA programmer who has not mastered the basic principles of clear design \nis not likely to write efficient programs. Conversely, concerns related to development \ncosts and maintainability should not be used as an excuse to justify inefficient \nperformance. Generality in design can and should be achieved without sacrificing \nperformance, but this can only be done if the designer understands how to measure \nperformance and does so as an integral part of the design and implementation process. \nMost computer science curricula recognize that good programming skills begin \nwith a strong emphasis on fundamental software engineering principles. Then, \nonce a programmer has learned the principles of clear program design and implementation, \nthe next step is to study the effects of data organization and algorithms \non program efficiency. \nApproach: This book describes many techniques for representing data. These \ntechniques are presented within the context of the following principles: \n1. Each data structure and each algorithm has costs and benefits. Practitioners \nneed a thorough understanding of how to assess costs and benefits to be able \nto adapt to new design challenges. This requires an understanding of the \nprinciples of algorithm analysis, and also an appreciation for the significant \neffects of the physical medium employed (e.g., data stored on disk versus \nmain memory). \n2. Related to costs and benefits is the notion of tradeoffs. For example, it is quite \ncommon to reduce time requirements at the expense of an increase in space \nrequirements, or vice versa. Programmers face tradeoff issues regularly in all \nphases of software design and implementation, so the concept must become \ndeeply ingrained. \n3. Programmers should know enough about common practice to avoid reinventing \nthe wheel. Thus, programmers need to learn the commonly used \ndata structures, their related algorithms, and the most frequently encountered \ndesign patterns found in programming. \n4. Data structures follow needs. Programmers must learn to assess application \nneeds first, then find a data structure with matching capabilities. To do this \nrequires competence in Principles 1, 2, and 3.
Author: Clifford A. Shaffer
Institution: Virginia Tech
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Keywords: data structures, algorithm analysis, program efficiency, performance measurement, time and space complexity, trade-offs, data representation, design patterns, sorting algorithms, search algorithms, disk storage, software engineering principles, software maintainability, object-oriented programming, linked lists, trees, graphs, hash tables, binary search trees, heaps, sorting networks, divide-and-conquer
Open Access status: green
OpenAlex ID: W2810016165
