#### 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

# Divide and conquer algorithms

A divide and conquer algorithm breaks a complex problem into smaller problems and solves these smaller problems. The smaller problem will be further broken down till it is a known problem. The approach is to recursively solve the sub-problems and merge the solutions of the sub-problems.

Recursion, quick sort, binary search, fast Fourier transform, and merge sort are good examples of divide and conquer algorithms. Memory is efficiently used with these algorithms. Performance is sometimes an issue in the case of recursion. On multiprocessor machines, these algorithms can be executed on different processors after breaking them down into sub-problems. A divide and conquer algorithm is shown in the following code:

`//main package has examples shown// in Hands-On Data Structures and algorithms with Go bookpackage main// importing fmt packageimport (    ...`