Algorithm in Golang

Reference: https://www.geeksforgeeks.org/

Algorithms

Sorting Algorithms

• Selection Sort
• Stable Selection Sort
• Bubble Sort
• Recursive Bubble Sort
• Insertion Sort
• Merge Sort
• Recursive Insertion Sort
• Quick Sort
• Iterative Quick Sort
• Heap Sort
• Counting Sort
• Radix Sort
• Bucket Sort
• ShellSort
• TimSort
• Comb Sort
• Pigeonhole Sort
• Cycle Sort
• Cocktail Sort
• Strand Sort
• Bitonic Sort
• Pancake sorting
• Binary Insertion Sort
• BogoSort or Permutation Sort
• Gnome Sort
• Sleep Sort – The King of Laziness / Sorting while Sleeping
• Structure Sorting (By Multiple Rules) in C++
• Stooge Sort
• Tag Sort (To get both sorted and original)
• Tree Sort
• Cartesian Tree Sorting
• Odd-Even Sort / Brick Sort
• QuickSort on Singly Linked List
• QuickSort on Doubly Linked List
• 3-Way QuickSort (Dutch National Flag)
• Merge Sort for Linked Lists
• Merge Sort for Doubly Linked List
• 3-way Merge Sort

Searching Algorithms

Graph Algorithms

Pattern Algorithms

Geometric Algorithms

Mathematical

Randomized Algorithms

Greedy Algorithms

Dynamic Programming

• Dynamic Programming
• Floyd Warshall Algorithm
• Bellman–Ford Algorithm
• 0-1 Knapsack Problem

Manacher’s Algorithm

• Manacher’s Algorithm – Linear Time Longest Palindromic Substring – Part 1
• Manacher’s Algorithm – Linear Time Longest Palindromic Substring – Part 2
• Manacher’s Algorithm – Linear Time Longest Palindromic Substring – Part 3
• Manacher’s Algorithm – Linear Time Longest Palindromic Substring – Part 4

Divide and Conquer

Backtracing

• Backtracking | Set 1 (The Knight’s tour problem)

Branch and Bound

---

Data Structures

Heap

• Binary Heap
• Binomial Heap
• Fibonacci Heap
• Leftist Heap
• K-ary Heap
• Segment Tree
  • Sum of given range
  • Range Minimum Query
  • XOR of given range

Graph Data Structure And Algorithms

https://www.geeksforgeeks.org/graph-data-structure-and-algorithms/

• Graph and its representations
• Graph implementation using STL for competitive programming | Set 1 (DFS of Unweighted and Undirected)
• Graph implementation using STL for competitive programming | Set 2 (Weighted graph)
• Graph representations using set and hash
• Trie | (Insert and Search)