Hands-On Data Structures and Algorithms with Go

Kommadi, Bhagvan,

ISBN 10: 1789618509 / ISBN 13: 9781789618501

Editore: Packt Publishing 2019-03, 2019

Riguardo questo articolo

Codice articolo 6666-IUK-9781789618501

Dati bibliografici

• Titolo: Hands-On Data Structures and Algorithms with Go
• Editore: Packt Publishing 2019-03
• Data di pubblicazione: 2019
• Lingua: Inglese
• ISBN 10: 1789618509
• ISBN 13: 9781789618501
• Rilegatura: PF
• Condizione: New

Descrizione articolo

Riassunto

Explore Golang's data structures and algorithms to design, implement, and analyze code in the professional setting

Key Features

• Learn the basics of data structures and algorithms and implement them efficiently
• Use data structures such as arrays, stacks, trees, lists and graphs in real-world scenarios
• Compare the complexity of different algorithms and data structures for improved code performance

Book Description

Golang is one of the fastest growing programming languages in the software industry. Its speed, simplicity, and reliability make it the perfect choice for building robust applications. This brings the need to have a solid foundation in data structures and algorithms with Go so as to build scalable applications. Complete with hands-on tutorials, this book will guide you in using the best data structures and algorithms for problem solving.

The book begins with an introduction to Go data structures and algorithms. You'll learn how to store data using linked lists, arrays, stacks, and queues. Moving ahead, you'll discover how to implement sorting and searching algorithms, followed by binary search trees. This book will also help you improve the performance of your applications by stringing data types and implementing hash structures in algorithm design. Finally, you'll be able to apply traditional data structures to solve real-world problems.

By the end of the book, you'll have become adept at implementing classic data structures and algorithms in Go, propelling you to become a confident Go programmer.

What you will learn

• Improve application performance using the most suitable data structure and algorithm
• Explore the wide range of classic algorithms such as recursion and hashing algorithms
• Work with algorithms such as garbage collection for efficient memory management
• Analyze the cost and benefit trade-off to identify algorithms and data structures for problem solving
• Explore techniques for writing pseudocode algorithm and ace whiteboard coding in interviews
• Discover the pitfalls in selecting data structures and algorithms by predicting their speed and efficiency

Who this book is for

This book is for developers who want to understand how to select the best data structures and algorithms that will help solve coding problems. Basic Go programming experience will be an added advantage.

Table of Contents

1. Data Structures & Algorithms
2. Getting Started with Go for Data Structures & Algorithms
3. Linear Data Structures
4. Non Linear Data Structures
5. Homogeneous Data Structures
6. Heterogeneous Data Structures
7. Dynamic Data Structures
8. Classic Algorithms
9. Network and Sparse Matrix Representation
10. Memory Management
11. Next Steps (Appendix)