Marknadens största urval
Snabb leverans

Data Structures and Algorithms with Go

Om Data Structures and Algorithms with Go

Dive into the endless possibilities of data structures and algorithms and have fun doing it ¿DESCRIPTION Go, designed by Google, is a modern, open-source language known for its simplicity, readability, and efficiency. It excels at building web applications, network tools, and cloud services. Its clear syntax and built-in concurrency features make it a popular choice for modern developers. This guide simplifies the basics by introducing arrays, lists, stacks, queues, maps, trees, and graphs in a practical way. Get hands-on experience, understand essential operations, and compare strengths and weaknesses. Perfect your skills with searching, sorting, and efficient data retrieval techniques. Traverse graphs and trees with ease, all illustrated in the Go code for real-world application, and conclude with insights for ongoing learning. After reading this book, the reader can determine when and why specific data structures should be used and when an algorithm best fits the actual problem's solution. WHAT YOU WILL LEARN ¿ Decide which data structure is the most suitable for a particular problem. ¿ Implement different algorithms with the Go programming language. ¿ Recognize which algorithm is best suited for certain scenarios. ¿ Utilize data structures and algorithm implementations from Go's standard library. ¿ Learn how real-life problems can be solved and simulated. WHO THIS BOOK IS FOR The book targets beginners and experienced developers who want to learn how to implement particular algorithms. It is also helpful for developers who wish to expand their knowledge of data structures and algorithms.

Visa mer
  • Språk:
  • Engelska
  • ISBN:
  • 9789355518897
  • Format:
  • Häftad
  • Sidor:
  • 188
  • Utgiven:
  • 12. februari 2024
  • Mått:
  • 152x10x229 mm.
  • Vikt:
  • 282 g.
  I lager
Leveranstid: 4-7 vardagar
Förväntad leverans: 8. januari 2025
Förlängd ångerrätt till 31. januari 2025
  •  

    Kan ej levereras före jul.
    Köp nu och skriv ut ett presentkort

Beskrivning av Data Structures and Algorithms with Go

Dive into the endless possibilities of data structures and algorithms and have fun doing it
¿DESCRIPTION
Go, designed by Google, is a modern, open-source language known for its simplicity, readability, and efficiency. It excels at building web applications, network tools, and cloud services. Its clear syntax and built-in concurrency features make it a popular choice for modern developers.
This guide simplifies the basics by introducing arrays, lists, stacks, queues, maps, trees, and graphs in a practical way. Get hands-on experience, understand essential operations, and compare strengths and weaknesses. Perfect your skills with searching, sorting, and efficient data retrieval techniques. Traverse graphs and trees with ease, all illustrated in the Go code for real-world application, and conclude with insights for ongoing learning.
After reading this book, the reader can determine when and why specific data structures should be used and when an algorithm best fits the actual problem's solution.
WHAT YOU WILL LEARN
¿ Decide which data structure is the most suitable for a particular problem.
¿ Implement different algorithms with the Go programming language.
¿ Recognize which algorithm is best suited for certain scenarios.
¿ Utilize data structures and algorithm implementations from Go's standard library.
¿ Learn how real-life problems can be solved and simulated.
WHO THIS BOOK IS FOR
The book targets beginners and experienced developers who want to learn how to implement particular algorithms. It is also helpful for developers who wish to expand their knowledge of data structures and algorithms.

Användarnas betyg av Data Structures and Algorithms with Go



Hitta liknande böcker
Boken Data Structures and Algorithms with Go finns i följande kategorier:

Gör som tusentals andra bokälskare

Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.