更新时间:2021-06-24 15:38:47
coverpage
Title Page
Copyright and Credits
Learn Data Structures and Algorithms with Golang
About Packt
Why subscribe?
Packt.com
Contributors
About the author
About the reviewer
Packt is searching for authors like you
Preface
Who this book is for
What this book covers
To get the most out of this book
Download the example code files
Download the color images
Conventions used
Get in touch
Reviews
Section 1: Introduction to Data Structures and Algorithms and the Go Language
Data Structures and Algorithms
Technical requirements
Classification of data structures and structural design patterns
Classification of data structures
Lists
Tuples
Heaps
Structural design patterns
Adapter
Bridge
drawShape method
drawContour method
Composite
Decorator
Facade
Flyweight
Private class data
Proxy
Representation of algorithms
Flow chart
Pseudo code
Complexity and performance analysis
Complexity analysis of algorithms
Big O notation
Linear complexity
Quadratic complexity
Cubic complexity
Logarithmic complexity
Brute force algorithms
Divide and conquer algorithms
Backtracking algorithms
Summary
Questions and exercises
Further reading
Getting Started with Go for Data Structures and Algorithms
Arrays
Slices
The len function
Slice function
Two-dimensional slices
Maps
Database operations
The GetCustomer method
The InsertCustomer method
Variadic functions
The update operation
The delete operation
CRUD web forms
The defer and panic statements
The UpdateCustomer method
The DeleteCustomer method
CRM web application
The Create function
The Insert function
The Alter function
The Update function
The Delete function
The main method
The Header template
The Footer template
The Menu template
The Create template
The Update template
The View template
Questions
Section 2: Basic Data Structures and Algorithms using Go
Linear Data Structures
LinkedList
The Node class
The LinkedList class
The AddToHead method
The IterateList method
The LastNode method