English | 2018 | ISBN: 978-87-403-2578-2 | 405 pages | EPUB | 1.22 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.



DOWNLOAD
1dl