/golang-algorithms

Algorithms and data structures implemented in Golang with explanations and links to further readings

Primary LanguageGo

Golang Algorithms and Data Structures and Go Solution for LeetCode algorithm problems

Build Status codecov

This repository contains Golang based examples of many popular algorithms and data structures.

Each algorithm and data structure has its own separate README with related explanations and links for further reading (including ones to videos).

Read this in other languages: 简体中文

Data Structures

A data structure is a particular way of organizing and storing data in a computer so that it can be accessed and modified efficiently. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.

B - Beginner, A - Advanced

Algorithms

An algorithm is an unambiguous specification of how to solve a class of problems. It is a set of rules that precisely define a sequence of operations.

B - Beginner, A - Advanced

Algorithms by Topic

Algorithms by Paradigm

An algorithmic paradigm is a generic method or approach which underlies the design of a class of algorithms. It is an abstraction higher than the notion of an algorithm, just as an algorithm is an abstraction higher than a computer program.

Useful Information

Big O Notation

Big O notation is used to classify algorithms according to how their running time or space requirements grow as the input size grows. On the chart below you may find most common orders of growth of algorithms specified in Big O notation.

Big-O Complexity Chart

Source: Big O Cheat Sheet.

Common Data Structure Operations

Common Data Structure Operations

Array Sorting Algorithms

Array-Sorting_Algorithms