DIRECTORY.md

List of all files

Backtracking

• Graph Coloring
• Knight Tour
• Minimax
• N Queens
• N Queens All Solution Optimised
• Nqueen Print All Solutions
• Rat Maze
• Sudoku Solve

Bit Manipulation

• Hamming Distance

Ciphers

• Caesar Cipher
• Hill Cipher
• Morse Code
• Vigenere Cipher
• Xor Cipher

Data Structures

• Avltree
• Binary Search Tree
• Binary Search Tree2
• Binaryheap
• Circular Queue Using Linked List
• Cll
  • Cll
  • Cll
  • Main Cll
• Disjoint Set
• Doubly Linked List
• Linked List
• Linkedlist Implentation Usingarray
• List Array
• Morrisinorder
• Queue
• Queue Using Array
• Queue Using Array2
• Queue Using Linked List
• Queue Using Linkedlist
• Queue Using Two Stacks
• Skip List
• Stack
• Stack Using Array
• Stack Using Linked List
• Test Queue
• Test Stack
• Test Stack Students
• Tree
• Tree 234
• Trie Modern
• Trie Tree

Dynamic Programming

• 0 1 Knapsack
• Armstrong Number
• Bellman Ford
• Catalan Numbers
• Coin Change
• Coin Change Topdown
• Cut Rod
• Edit Distance
• Egg Dropping Puzzle
• Fibonacci Bottom Up
• Floyd Warshall
• Kadane
• Kadane2
• Longest Common String
• Longest Common Subsequence
• Longest Increasing Subsequence
• Longest Increasing Subsequence (Nlogn)
• Longest Palindromic Subsequence
• Matrix Chain Multiplication
• Palindrome Partitioning
• Searching Of Element In Dynamic Array
• Shortest Common Supersequence
• Tree Height
• Word Break

Geometry

• Jarvis Algorithm
• Line Segment Intersection

Graph

• Bidirectional Dijkstra
• Breadth First Search
• Bridge Finding With Tarjan Algorithm
• Connected Components
• Connected Components With Dsu
• Cycle Check Directed Graph
• Depth First Search
• Depth First Search With Stack
• Dijkstra
• Hamiltons Cycle
• Hopcroft Karp
• Is Graph Bipartite
• Kosaraju
• Kruskal
• Lowest Common Ancestor
• Max Flow With Ford Fulkerson And Edmond Karp Algo
• Prim
• Topological Sort
• Topological Sort By Kahns Algo

Graphics

• Spirograph

Greedy Algorithms

• Dijkstra
• Huffman
• Jumpgame
• Knapsack
• Kruskals Minimum Spanning Tree
• Prims Minimum Spanning Tree

Hashing

• Chaining
• Double Hash Hash Table
• Linear Probing Hash Table
• Quadratic Probing Hash Table

Linear Algebra

• Gram Schmidt

Machine Learning

• Adaline Learning
• Kohonen Som Topology
• Kohonen Som Trace
• Neural Network
• Ordinary Least Squares Regressor
• Vector Ops

Math

• Armstrong Number
• Binary Exponent
• Binomial Calculate
• Check Amicable Pair
• Check Factorial
• Check Prime
• Complex Numbers
• Double Factorial
• Eulers Totient Function
• Extended Euclid Algorithm
• Factorial
• Fast Power
• Fibonacci
• Fibonacci Fast
• Fibonacci Large
• Fibonacci Matrix Exponentiation
• Fibonacci Sum
• Gcd Iterative Euclidean
• Gcd Of N Numbers
• Gcd Recursive Euclidean
• Large Factorial
• Large Number
• Largest Power
• Lcm Sum
• Least Common Multiple
• Magic Number
• Miller Rabin
• Modular Division
• Modular Exponentiation
• Modular Inverse Fermat Little Theorem
• N Choose R
• Ncr Modulo P
• Number Of Positive Divisors
• Power For Huge Numbers
• Power Of Two
• Prime Factorization
• Prime Numbers
• Primes Up To Billion
• Realtime Stats
• Sieve Of Eratosthenes
• Sqrt Double
• String Fibonacci
• Sum Of Binomial Coefficient
• Sum Of Digits
• Vector Cross Product

Numerical Methods

• Bisection Method
• Brent Method Extrema
• Durand Kerner Roots
• False Position
• Gaussian Elimination
• Golden Search Extrema
• Lu Decompose
• Lu Decomposition
• Newton Raphson Method
• Ode Forward Euler
• Ode Midpoint Euler
• Ode Semi Implicit Euler
• Qr Decompose
• Qr Decomposition
• Qr Eigen Values
• Rungekutta
• Successive Approximation

Operations On Datastructures

• Array Left Rotation
• Array Right Rotation
• Circular Linked List
• Circular Queue Using Array
• Get Size Of Linked List
• Intersection Of 2 Arrays
• Reverse A Linked List Using Recusion
• Selectionsortlinkedlist
• Union Of 2 Arrays

Others

• Buzz Number
• Decimal To Binary
• Decimal To Hexadecimal
• Decimal To Roman Numeral
• Fast Integer Input
• Happy Number
• Matrix Exponentiation
• Palindrome Of Number
• Paranthesis Matching
• Pascal Triangle
• Postfix Evaluation
• Primality Test
• Smallest Circle
• Sparse Matrix
• Spiral Print
• Stairs Pattern
• Tower Of Hanoi
• Vector Important Functions

Probability

• Addition Rule
• Bayes Theorem
• Binomial Dist
• Poisson Dist

Range Queries

• Fenwick Tree
• Heavy Light Decomposition
• Mo
• Persistent Seg Tree Lazy Prop
• Segtree
• Sparse Table

Search

• Binary Search
• Exponential Search
• Fibonacci Search
• Hash Search
• Interpolation Search
• Interpolation Search2
• Jump Search
• Linear Search
• Median Search
• Saddleback Search
• Ternary Search
• Text Search

Sorting

• Bead Sort
• Bitonic Sort
• Bogo Sort
• Bubble Sort
• Bucket Sort
• Cocktail Selection Sort
• Comb Sort
• Count Inversions
• Counting Sort
• Counting Sort String
• Cycle Sort
• Gnome Sort
• Heap Sort
• Insertion Sort
• Library Sort
• Merge Insertion Sort
• Merge Sort
• Non Recursive Merge Sort
• Numeric String Sort
• Odd Even Sort
• Pancake Sort
• Pigeonhole Sort
• Quick Sort
• Quick Sort 3
• Radix Sort
• Radix Sort2
• Selection Sort
• Shell Sort
• Shell Sort2
• Slow Sort
• Strand Sort
• Swap Sort
• Tim Sort
• Wiggle Sort

Strings

• Brute Force String Searching
• Horspool
• Knuth Morris Pratt
• Rabin Karp