- Добавил: literator
- Дата: 20-01-2023, 05:45
- Комментариев: 0

Автор: Christopher Fox
Издательство: bookboon.com
Год: 2018
Страниц: 374
Язык: английский
Формат: pdf, epub, mobi
Размер: 10.2 MB
A concise introduction to data structures and algorithms in Go. Data structures are presented in a container hierarchy that includes stacks and queues as non-traversable dispensers, and lists, sets, and maps as traversable collections. Algorithm analysis is introduced and applied to linear and binary search, bubble sort, selection sort, insertion sort, merge sort and quicksort. The book also covers heaps and heapsort, unbalanced binary search trees, AVL trees, 2-3 trees, hashing, graph representations, and graph algorithms based on depth-and breadth-first search. Code is presented in Go (more about this in a moment), but the book does not teach Go and it does not include reference material about the language. The book does include features of pedagogical value: every chapter has review questions with answers, and a set of exercises. There is also a glossary at the end. The book (and versions of it using other programming languages) has been used successfully for several years to teach introductory algorithms and data structures at James Madison University. Many students have commented appreciatively regarding its brevity, clarity, and low cost. Go is a relatively new language from Google, and many students are interested in learning it. Overall, Go is an excellent choice for teaching algorithms and data structures.