Название книги: Структуры данных и алгоритмы в Java (второе издание)
Год: 2003
Автор: Роберт Лафоре
Язык: Английский
Формат: pdf
Размер: 3.5 MB

Описание книги «Структуры данных и алгоритмы в Java»:

This book is about data structures and algorithms as used in computer programming. Data structures are ways in which data is arranged in your computer’s memory (or stored on disk). Algorithms are the procedures a software program uses to manipulate the data in these structures.

Almost every computer program, even a simple one, uses data structures and algorithms. For example, consider a program that prints address labels. The program might use an array containing the addresses to be printed and a simple for loop to step through the array, printing each address.

The array in this example is a data structure, and the for loop, used for sequential
access to the array, executes a simple algorithm. For uncomplicated programs with
small amounts of data, such a simple approach might be all you need. However, for
programs that handle even moderately large amounts of data, or which solve problems that are slightly out of the ordinary, more sophisticated techniques are necessary. Simply knowing the syntax of a computer language such as Java or C++ isn’t enough.

This book is about what you need to know after you’ve learned a programming
language. The material we cover here is typically taught in colleges and universities
as a second-year course in computer science, after a student has mastered the
fundamentals of programming.

This book can be used as a text in a Data Structures and Algorithms course, typically taught in the second year of a computer science curriculum. However, it is also designed for professional programmers and for anyone else who needs to take the next step up from merely knowing a programming language. Because it’s easy to
understand, it is also appropriate as a supplemental text to a more formal course.

 

Оглавление:

Introduction

  1. Overview
  2. Arrays
  3. Simple Sorting
  4. Stacks and Queues
  5. Linked Lists
  6. Recursion
  7. Advanced Sorting
  8. Binary Trees
  9. Red-Black Trees
  10. 2-3-4 Trees and External Storage
  11. Hash Tables
  12. Heaps
  13. Graphs
  14. Weighted Graphs
  15. When to Use What

Appendixes

A. Running the Workshop Applets and Example Programs

B. Further Reading

C. Answers to Questions

Скачать: Структуры данных и алгоритмы в Java (второе издание)