#### Overview of this book

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.
Preface
Free Chapter
Section 1: Introduction to Data Structures and Algorithms and the Go Language
Data Structures and Algorithms
Getting Started with Go for Data Structures and Algorithms
Section 2: Basic Data Structures and Algorithms using Go
Linear Data Structures
Non-Linear Data Structures
Homogeneous Data Structures
Heterogeneous Data Structures
Dynamic Data Structures
Classic Algorithms
Section 3: Advanced Data Structures and Algorithms using Go
Network and Sparse Matrix Representation
Memory Management
Next Steps
Other Books You May Enjoy

# Slices

Go Slice is an abstraction over Go Array. Multiple data elements of the same type are allowed by Go arrays. The definition of variables that can hold several data elements of the same type are allowed by Go Array, but it does not have any provision of inbuilt methods to increase its size in Go. This shortcoming is taken care of by Slices. A Go slice can be appended to elements after the capacity has reached its size. Slices are dynamic and can double the current capacity in order to add more elements.

Let's take a look at the len function in the next section.

# The len function

The len() function gives the current length of slice, and the capacity of slice can be obtained using the cap() function. The following...