Algorithms-In-Java

Implementation of Algorithms in Java, Most of these names are picked up from GeeksForGeeks

1. Analysis of Algorithms

   • Time and Space Complexity
   • Choosing the right Algorithm

2. Searching Algorithms

   • Linear Search
   • Binary Search

3. Sorting Algorithms

   • Selection Sort
   • Insertion Sort
   • Bubble Sort
   • Merge Sort
   • Counting Sort
   • Shell Sort
   • Quick Sort
   • Heap Sort
   • Radix Sort

4. Standard Algorithms

   • Euclid's Algorithm

5. Advanced Algorithms

   • Greedy Algorithms
     • Travelling Salesman Problem
     • Prim's Minimal Spanning Tree Algorithm
     • Kruskal's Minimal Spanning Tree Algorithm
     • Dijkstra's Minimal Spanning Tree Algorithm
     • Dijkstra's Shortest Path
     • Graph - Map Coloring
     • Graph - Vertex Cover
     • Knapsack Problem
     • Job Scheduling Problem
     • Huffman Coding
     • Reverse Delete
   • Divide and Conquer
     • Merge Sort
     • Quick Sort
     • Binary Search
     • Strassen's Matrix Multiplication
     • Closest pair (points)
     • Cooley–Tukey Fast Fourier Transform (FFT) Algorithm
     • Karatsuba algorithm for fast multiplication
   • Miscellaneous
     • Rabin Karp Substring Search
     • MapReduce
     • Bellmen-Ford Algorithm
     • A*
     • Bipartric Graph
     • P, NP and NP Complete

6. Bit Manipulation

   • Introduction to Bits
   • Common Operations on Bits
   • Useful Operations on Bits

7. Dynamic Programming

   • Fibonacci number series
   • Knapsack Problem
   • Tower of Hanoi
   • All pair shortest path by Floyd-Warshall
   • Shortest path by Dijkstra
   • Project Scheduling

8. Recursion

   • Fibonacci Problem
   • Tower of Hanoi

9. Regex

   • Regex for US Phone Number
   • Regex for Email
   • Regex for IP Address
   • Regex Pattern Matcher implementation