|
|
|
|
| LEADER |
00000cam a2200000 a 4500 |
| 001 |
on1336406061 |
| 003 |
OCoLC |
| 005 |
20240808213014.0 |
| 006 |
m o d |
| 007 |
cr cnu---unuuu |
| 008 |
220716s2022 cau o 001 0 eng d |
| 040 |
|
|
|a EBLCP
|b eng
|e pn
|c EBLCP
|d ORMDA
|d EBLCP
|d GW5XE
|d YDX
|d OCLCQ
|d OCLCF
|d UKAHL
|d OCLCQ
|d OCLCO
|d OCLCL
|
| 019 |
|
|
|a 1336007352
|
| 020 |
|
|
|a 9781484281918
|q (electronic bk.)
|
| 020 |
|
|
|a 1484281918
|q (electronic bk.)
|
| 020 |
|
|
|z 148428190X
|
| 020 |
|
|
|z 9781484281901
|
| 024 |
7 |
|
|a 10.1007/978-1-4842-8191-8
|2 doi
|
| 035 |
|
|
|a (OCoLC)1336406061
|z (OCoLC)1336007352
|
| 037 |
|
|
|a 9781484281918
|b O'Reilly Media
|
| 050 |
|
4 |
|a QA76.9.D35
|
| 072 |
|
7 |
|a COM000000
|2 bisacsh
|
| 049 |
|
|
|a HCDD
|
| 100 |
1 |
|
|a Wiener, Richard,
|d 1941-
|1 https://id.oclc.org/worldcat/entity/E39PCjC99Y7bP6Tf8FKRCTGXHP
|
| 245 |
1 |
0 |
|a Generic data structures and algorithms in Go :
|b an applied approach using concurrency, genericity and heuristics /
|c Richard Wiener.
|
| 260 |
|
|
|a Berkeley, CA :
|b Apress L.P.,
|c 2022.
|
| 300 |
|
|
|a 1 online resource (590 pages)
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 588 |
0 |
|
|a Print version record.
|
| 520 |
|
|
|a 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 for solving 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.
|
| 505 |
0 |
|
|a 1. A Tour Of Generics and Concurrency In Go -- 2. Algorithm Efficiency Sorting and Searching -- 3. Abstract Data Types: OOP Without Classes in Go -- 4. ADT In Action: Game Of Life -- 5. Stacks -- 6. Queues and Lists -- 7. Hash Tables -- 8. Binary Trees -- 9. Binary Search Tree -- 10. AVL Trees -- 11. Heap Trees -- 12. Red Black Trees -- 13. Expression Trees -- 14. Ecological Simulation With Concurrency -- 15. Dynamic Programming -- 16. Graph Structures -- 17. Travelling Salesperson Problem -- 18. Branch and Bound Solution to TSP -- 19. Simulated Annealing Heuristic Solution to TSP -- 20. Genetic Algorithm for TSP -- 21. Neural Networks and Machine Learning.
|
| 650 |
|
0 |
|a Go (Computer program language)
|
| 650 |
|
0 |
|a Data structures (Computer science)
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
7 |
|a algorithms.
|2 aat
|
| 650 |
|
7 |
|a Algorithms
|2 fast
|
| 650 |
|
7 |
|a Data structures (Computer science)
|2 fast
|
| 650 |
|
7 |
|a Go (Computer program language)
|2 fast
|
| 776 |
0 |
8 |
|i Print version:
|a Wiener, Richard.
|t Generic Data Structures and Algorithms in Go.
|d Berkeley, CA : Apress L.P., ©2022
|z 9781484281901
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://link.springer.com/10.1007/978-1-4842-8191-8
|y Click for online access
|
| 903 |
|
|
|a SPRING-COMPUTING2022
|
| 994 |
|
|
|a 92
|b HCD
|