The Programmer's Handbook by Michael Wilson
  • Introduction
  • Data Structures
    • Introduction
    • Arrays
    • Lists
    • Stacks and Queues
    • Hash Tables
    • Trees
    • Tries
    • Graphs
  • Algorithms
    • Introduction
    • Sorting
    • Graph
    • Greedy
    • Dynamic Programming
    • Backtracking
    • Branch and Bound
    • Divide and Conquer
  • Web Systems
    • Introduction
  • Computer Organization
    • Introduction
    • Combinational Logic
    • Assembly Instruction Sets
    • Floating Point Representation
    • Finite State Machines and CPUs
    • Pipelining
    • Caching
  • Operating Systems
    • Introduction
    • Concurrency
    • Synchronization
    • Virtual Memory
    • File Systems
  • Computing Theory
    • Introduction
  • Languages
    • Introduction
    • C++
    • Python
    • Go
  • *nix Systems
    • Introduction
    • Commands
    • Directories
Powered by GitBook
On this page
  1. Languages

Go

PreviousPythonNextIntroduction

Last updated 5 years ago

Go is expressive, concise, clean, and efficient. Its concurrency mechanisms make it easy to write programs that get the most out of multicore and networked machines, while its novel type system enables flexible and modular program construction. Go compiles quickly to machine code yet has the convenience of garbage collection and the power of run-time reflection. It's a fast, statically typed, compiled language that feels like a dynamically typed, interpreted language. -

golang.org