All young computer scientists who aspire to write programs must learn something about algorithms and data structures. This book does exactly that. Based on lecture courses developed by the author over a number of years the book is written in an informal and friendly way specifically to appeal to students. The book is divided into four parts: the first on Data Structures introduces a variety of structures and the fundamental operations associated with them, together with descriptions of how they are implemented in Pascal; the second discusses algorithms and the notion of complexity; Part III is concerned with the description of successively more elaborate structures for the storage of records and algorithms for retrieving a record from such a structure by means of its key; and finally, Part IV consists of very full solutions to nearly all the exercises in the book.Suppose we have two algorithms P, and P. for the same problem class, with worst case complexities W1 and W2 given by ... but if we implement P3 on a computer which runs 1000 times faster than the one used for P the time required for theanbsp;...
|Title||:||Data Structures and Algorithms: A First Course|
|Author||:||Iain T. Adamson|
|Publisher||:||Springer Science & Business Media - 2012-12-06|