Data structures and Algorithm Analysis in C, 2e
In the second edition of this best-selling book, the author continues to refine and enhance his innovative approach to algorithms and data structures. Using a C implementation, he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time.
This book, Data Structure and Algorithm Analysis in C, describes data structures, methods of organizing pledge amounts of data and algorithm analysis, the estimation of the running time of algorithm's. As computers become faster and faster, the need for programs that can handle large amounts of input become more acute. This requires more careful attention to efficiency, since inefficiencies in programs become most obvious when input sizes are large. By analyzing an algorithm before it is actually coded, students can decide if a particular solution will be feasible. For example, in this text students look at specific problems and see ho9w careful implementatio9ns can reduce the time constraints for large amounts of data from 16 years to less than a second. Therefore, no algorithm or data structure is presented without an explanation of its running time. In some cases, minute details that affect the running time of the implementation are explored.
| Book | |
|---|---|
| Author | Weiss |
| Pages | 528 |
| Year | 2005 |
| ISBN | 9788177583588 |
| Publisher | Pearson |
| Language | English |
| Uncategorized | |
| Edition | 2/e |
| Weight | 602 g |
| Dimensions | 20.3 x 25.4 x 4.7 cm |
| Binding | Paperback |