Skip to content

Latest commit

 

History

History
54 lines (49 loc) · 967 Bytes

README.md

File metadata and controls

54 lines (49 loc) · 967 Bytes

algorithms

An implementation in GO (golang) of the basic algorithms and data structure.

Sorting algorithms

  • Selection sort
  • Insertion sort
  • Bubble sort
  • Merge sort
  • Quick sort
  • 3 Way Quick sort
  • Heap sort
  • Select sort
  • Shell sort
  • Shuffle

DataStructure

  • Queue
    • Linked list
  • Stack
    • Linked list
    • Array
  • Iterator
  • Heap
  • Tree
    • DFS pre-order traversal (Depth First Search)
    • DFS in order traversal (Depth First Search)
    • DFS post-order traversal (Depth First Search)
    • BFS level order (Breadth First Search)
  • Binaray Search Tree (BST)
  • Hash
    • Separate chaining
    • Linear probing
  • Graph (in progress)
    • Depth First Search (DFS)
    • Breadth First Search (BFS)
    • Connected components
  • Trie
    • R-Way Trie
    • Ternary Search Trie

Union find

  • QuickFind
  • QuickUnion
  • Weighted QuickUnion
  • Weighted QuickUnion with path compression

Mathematic

  • Deletion
  • Multiplication
  • Division
  • Pow
  • Fibonacci
  • IsPrime