Baike.dev
All toolsOnline toolsAI codingTrendingOpen sourceNewsSubmit
Log in
< Back to tools
A

algorithms

> 编程语言
Open source

Algorithms & Data Structures in Go

1.9K stars0 likes3 views
WebsiteGitHub

About

Algorithms & Data Structures in Go

Algorithms

Classic algorithms and data structures implemented in Go. Not for production use, it is mostly an attempt to get comfortable both with Go and key CS concepts.

Contents

Data Structures

  • Binary Search Tree (wiki)
  • Graph (wiki)
  • Hash Tables (wiki)
  • Linked List (wiki)
  • Matrix (wiki)
  • Min/Max Heap (wiki)
  • Priority Queue (wiki)
  • Queue (wiki)
  • Stack (wiki)

Graph algorithms

Searching:

  • Depth First Search (wiki)
  • Breadth First Search (wiki)
  • Kosaraju's Algorithm (find all SCCs) (wiki)

Shortest path:

  • Breadth First Search Shortest Path (wiki)
  • Dijkstra (wiki)

Sorting:

  • Topological Sort (wiki)

Maths algorithms

  • Binary GCD algorithm (wiki)
  • Closest pairs (wiki)
  • FastPower (wiki)
  • Fibonacci (wiki)
  • Fisher-Yates Shuffle (wiki)
  • Erastothenes Sieve (wiki)
  • Extented GCD algorithm (wiki)
  • Karatsuba's Multiplication (wiki)
  • Newton's Square Root (wiki)
  • Permutations Count
  • Strassen's matrix multiplication (wiki)
  • Randomized Selection

Sorting algorithms

  • Bubble Sort (wiki)
  • Heap Sort (wiki)
  • Quick Sort (wiki)
  • Merge Sort (wiki)
  • Insertion Sort (wiki)
  • Shell Sort (wiki)
  • Selection Sort (wiki)

Searching algorithms

  • Binary Search (wiki)

Issues· 0 open

View all issuesOpen on GitHub

No open issues yet, or sync has not completed.

> Tags

Go

No comments yet. Be the first to share.

> Details

PublishedAug 1, 2026
UpdatedSep 17, 2026
Category编程语言
PricingOpen source

> Related tools

T
TypeScript
JavaScript 的超集,为前端与全栈提供静态类型
P
Python
通用编程语言,广泛用于 Web、数据与 AI
G
Go
Google 推出的简洁高效系统语言