Transcription of Data Structures and Algorithm Analysis in C - PBworks
{{id}} {{{paragraph}}}
Example: air traffic controller
Data Structures and Algorithm Analysis in C - PBworks
Data Structures and Algorithm Analysis in C by Mark Allen Weiss PREFACE CHAPTER 1: INTRODUCTION CHAPTER 2: Algorithm Analysis CHAPTER 3: LISTS, STACKS, AND QUEUES CHAPTER 4: TREES CHAPTER 5: HASHING CHAPTER 6: PRIORITY QUEUES (HEAPS) CHAPTER 7: SORTING CHAPTER 8: THE DISJOINT SET ADT CHAPTER 9: GRAPH ALGORITHMS CHAPTER 10: Algorithm DESIGN TECHNIQUES CHAPTER 11: AMORTIZED Analysis 1/1 Structures , Algorithm Analysis : Table of Purpose/Goals This book describes data Structures , methods of organizing large amounts of data, and Algorithm Analysis , the estimation of the running time of algorithms. As computers become faster and faster, the need for programs that can handle large amounts of input becomes more acute. Paradoxically, this requires more careful attention to efficiency, since inefficiencies in programs become most obvious when input sizes are large.
Once a solution method is determined, a program must still be written. ... thus requiring development of more intricate programs to solve the problems. The goal of this text is to teach students good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency.
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: