omidmohebbise/programming-algorithms

Java

Programming Algorithms:

Searching Algorithms:

Linear Search
Binary Search (practice1)
[] Depth-First Search (DFS)
[] Breadth-First Search (BFS)
[] Interpolation Search

Sorting Algorithms:

[] Bubble Sort
[] Insertion Sort
[] Selection Sort
[] Merge Sort
[] Quick Sort
[] Heap Sort
[] Radix Sort

Graph Algorithms:

[] Dijkstra's Algorithm
[] Kruskal's Algorithm
[] Prim's Algorithm
[] Bellman-Ford Algorithm
[] Floyd-Warshall Algorithm
[] Topological Sorting

##Dynamic Programming:

[] Longest Common Subsequence
[] Knapsack Problem
[] Matrix Chain Multiplication
[] Fibonacci Sequence
[] Coin Change Problem
[] Edit Distance

Greedy Algorithms:

[] Huffman Coding
[] Prim's Algorithm for Minimum Spanning Tree
[] Kruskal's Algorithm for Minimum Spanning Tree
[] Dijkstra's Algorithm for Shortest Path

Divide and Conquer:

[] Merge Sort
[] Quick Sort
[] Strassen's Matrix Multiplication
[] Closest Pair of Points

Backtracking Algorithms:

[] N-Queens Problem
[] Sudoku Solver
[] Hamiltonian Cycle
[] Subset Sum

String Matching Algorithms:

[] Naive String Matching
[] Rabin-Karp Algorithm
[] Knuth-Morris-Pratt Algorithm
[] Boyer-Moore Algorithm

Numeric Algorithms:

[] Euclidean Algorithm (GCD)
[] Sieve of Eratosthenes (Prime Numbers)
[] Binary Exponentiation
[] Newton's Method (Root Finding)

Machine Learning Algorithms:

[] Linear Regression
[] Logistic Regression
[] Decision Trees
[] k-Nearest Neighbors (k-NN)
[] Support Vector Machines (SVM)
[] Neural Networks

Geometric Algorithms:

[] Convex Hull (Graham's Scan, Jarvis March)
[] Line Intersection
[] Closest Pair of Points
[] Polygon Triangulation

Cryptography Algorithms:

[] RSA Algorithm
[] Diffie-Hellman Key Exchange
[] AES (Advanced Encryption Standard)
[] Hash Functions (MD5, SHA-256)