Skip to content

Latest commit

 

History

History
44 lines (42 loc) · 1.11 KB

File metadata and controls

44 lines (42 loc) · 1.11 KB

Data Structures and Algorithms

This Repository contains the following algorithms implemented in C, C++, Java, Python

Algorithms


  • Back Tracking :
    • Graph coloring
    • Hamiltonian Cycle
    • Nqueen
  • Divide and Conquer

    • Merge Sort
    • Quick Sort
    • Ranromized Quicksort
    • log(N) exponentiation
  • Dynamic Programming

    • 0/1 Knapsack
    • Floyd Warshall All Pairs Shortest Path
    • Matrix Chain Multiplication
    • Coin Change
    • Maximum Sub Sub Array
    • Rod cutting
    • Edit Distance
    • Longest Common Substring
    • Longest Common Subsequence
  • Graph Theory

    • Breadth First Search
    • Depth First Search
    • Cycle Detection using Disjoint Set ( Union Find )
    • Minimal Spanning Tree kruskal's
    • Minimal Spanning Tree Prims
    • Dijkstra Shortest Path
    • Topological Sort
    • Bellman Ford Shortest Path
    • Travelling Salesman Brute Force
  • Greefy

    • Fractional Knapsack
    • Job Sequence with deadline
    • Activity Selection
  • Combinatorics

    • Print Superset
    • Narayana Pandita's Next Permutation
  • Pattern Matching

    • KMP