Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Learn Data Structures and Algorithms with Golang
  • Table Of Contents Toc
  • Feedback & Rating feedback
Learn Data Structures and Algorithms with Golang

Learn Data Structures and Algorithms with Golang

By : Bhagvan Kommadi
2.6 (10)
close
close
Learn Data Structures and Algorithms with Golang

Learn Data Structures and Algorithms with Golang

2.6 (10)
By: Bhagvan Kommadi

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.
Table of Contents (16 chapters)
close
close
Free Chapter
1
Section 1: Introduction to Data Structures and Algorithms and the Go Language
4
Section 2: Basic Data Structures and Algorithms using Go
11
Section 3: Advanced Data Structures and Algorithms using Go

Questions

  1. Which method of the sort.Sort interface returns the size of the elements to be sorted?
  2. Which function needs to be passed to the sort.Slice method to sort a slice?
  3. What does the swap method do to the elements at the i and j indices?
  4. What is the default order for sorting elements using sort.Sort?
  5. How do you implement ascending and descending sorting with sort.Slice?
  6. How do you sort an array and keep the original order of the elements?
  7. Which interface is used to reverse the order of the data?
  8. Show an example of sorting a slice.
  9. Which method is called to add elements to an unordered list?
  10. Write a code example of an unordered list of floats.

Unlock full access

Continue reading for free

A Packt free trial gives you instant online access to our library of over 7000 practical eBooks and videos, constantly updated with the latest in tech

Create a Note

Modal Close icon
You need to login to use this feature.
notes
bookmark search playlist download font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete

Delete Note

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete

Edit Note

Modal Close icon
Write a note (max 255 characters)
Cancel
Update Note

Confirmation

Modal Close icon
claim successful

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY