Skip to main content
SpringerLink
Log in
Apress
Book cover

Generic Data Structures and Algorithms in Go

An Applied Approach Using Concurrency, Genericity and Heuristics

  • Book
  • © 2022

Overview

Authors:
  1. Richard Wiener

    1. Colorado Springs, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Uniquely covers generics-based data structures and algorithms in Golang
  • Features the use of concurrency using go-routines whenever possible and appropriate
  • Presents heuristic algorithm design in solving computationally hard problems such as combinatoric optimization

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (21 chapters)

  1. Front Matter

    Pages i-xxv
    Download chapter PDF

  2. A Tour of Generics and Concurrency in Go

    • Richard Wiener
    Pages 1-54

  3. Algorithm Efficiency: Sorting and Searching

    • Richard Wiener
    Pages 55-89

  4. Abstract Data Types: OOP Without Classes in Go

    • Richard Wiener
    Pages 91-121

  5. ADT in Action: Game of Life

    • Richard Wiener
    Pages 123-140

  6. Stacks

    • Richard Wiener
    Pages 141-185

  7. Queues and Lists

    • Richard Wiener
    Pages 187-236

  8. Hash Tables

    • Richard Wiener
    Pages 237-263

  9. Binary Trees

    • Richard Wiener
    Pages 265-286

  10. Binary Search Tree

    • Richard Wiener
    Pages 287-314

  11. AVL Trees

    • Richard Wiener
    Pages 315-347

  12. Heap Trees

    • Richard Wiener
    Pages 349-362

  13. Red-Black Trees

    • Richard Wiener
    Pages 363-385

  14. Expression Trees

    • Richard Wiener
    Pages 387-399

  15. Ecological Simulation with Concurrency

    • Richard Wiener
    Pages 401-425

  16. Dynamic Programming

    • Richard Wiener
    Pages 427-440

  17. Graph Structures

    • Richard Wiener
    Pages 441-464

  18. Travelling Salesperson Problem

    • Richard Wiener
    Pages 465-476

  19. Branch-and-Bound Solution to TSP

    • Richard Wiener
    Pages 477-491

  20. Simulated Annealing Heuristic Solution to TSP

    • Richard Wiener
    Pages 493-521
Back to top

Keywords

About this book

Advance your understanding of generic data structures and algorithms and their applications using Go and the effective use of concurrency. You are invited on a journey that aims to improve your programming and problem-solving skills. This book takes you to the next step by showing how to get your programs to work efficiently as well as correctly. 


As you explore many data structures and the algorithms and applications associated with them, you'll focus on the trade-offs between speed and storage and the benefits of deploying concurrency when appropriate. This book will demonstrate the huge increases in application performance that are possible. The presentation of classic data structures and techniques of algorithm design (greedy, divide and conquer, branch-and-bound to name a few) provides an essential foundation and toolkit for problem solving. But this book goes further by presenting heuristic algorithms and their implementations forsolving computationally intractable combinatoric optimization problems such as the travelling salesperson problem. Simulated annealing and genetic algorithms are among the techniques used.



The consistent style of coding used throughout this book exploits Go’s ability to implement abstract, generic and constrained generic data types without the use of classes.  Although some familiarity with Go is assumed, this book should advance your ability to use Go to tackle server-side applications, games, machine learning, information retrieval and other application domains where speed and storage efficiency is essential.



What You'll Learn
  • Explore classical data structures and algorithms aimed at making your applications run faster or require less storage
  • Use the new generic features of Go to build reusable data structures
  • Utilize concurrency for maximizing application performance
  • See the power of heuristic algorithms for computationally intractable problems
  • Enhance and improve your Go programming skills

Who This Book Is For


Practicing Go software developers and students who wish to advance their programming and problem-solving skills and experience the excitement and see the benefits of using generic data structures and algorithms that utilize concurrency whenever possible.

Authors and Affiliations

  • Colorado Springs, USA

    Richard Wiener

About the author

Richard Wiener, Ph.D. authored or co-authored 22 professional, software development and computer-science textbooks published by Wiley, Addison-Wesley, Prentice-Hall, Cambridge University Press and Thompson.  Served as founding Editor-in-Chief of the Journal of Object-Oriented Programming for 12 years and later, founding Editor-in-Chief of the Journal of Object Technology for 9 years.  Worked as Associate Professor of Computer Science at the University of Colorado, Colorado Springs (UCCS) from 1977-2012.  Served as Department Chair during last four years at UCCS. Served as consultant and software developer for IBM, HP, Boeing, Textronix, DEC and many other companies.  Presented industry short-courses all over the world from 1980 to 2006. Earned BS and MS in Electrical Engineering from City University of New York and Ph.D. from Polytechnic Institute of New York.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation