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

# Sparse matrix representation using a list of lists

A sparse matrix is a two-dimensional list of m rows and n columns. The shape of a matrix is m x n if it consists of m rows and n columns. Sparse matrices are used for solving large-scale problems that do not require dense matrices. For example, partial differential equations are solved by using the finite element method (FEM). Tuples of a sparse matrix are non-zero elements of the matrix.

In the following code, a sparse matrix is modeled as a list of lists. A sparse matrix consists of cells that are a list of lists. Each cell has properties such as Row, Column, and Value:

///main package has examples shown
// in Go Data Structures and algorithms book
package main

// importing fmt package
import (
"fmt"
)

//List of List
type LOL struct {
Row int
Column int
Value float64
}

The next section talks about the SparseMatrix class...