This GitHub repository contains algorithms written in Go. The algorithms cover a wide range of topics, including sorting, searching, and graph algorithms.

  • By Lakshmi Narasimman
  • Last update: Aug 12, 2022
  • Comments: 0

Algorithms in Go

This repository contains a collection of algorithms implemented in Go. The algorithms are divided into several categories:

  • Sorting algorithms
  • Searching algorithms
  • Graph algorithms

Sorting algorithms

Sorting algorithms are used to sort a data structure in a specific order. This repository contains the following sorting algorithms:

  • Bubble sort
  • Selection sort
  • Insertion sort
  • Quick sort
  • Merge sort
  • Heap sort

Searching algorithms

Searching algorithms are used to find an element in a data structure. This repository contains the following searching algorithms:

  • Linear search
  • Binary search

Graph algorithms

Graph algorithms are used to solve problems on graphs. This repository contains the following graph algorithms:

  • Breadth-first search (BFS)
  • Depth-first search (DFS)
  • Topological sort
  • Minimum spanning tree (MST)
  • Shortest path

Contributor's Guide

Please feel free to contribute to this repository by adding new algorithms or improving existing ones. If you want to add a new algorithm, please create a new file in the appropriate category and include appropriate comments. If you want to improve an existing algorithm, please submit a pull request.