t
he
a
rt
o
f
Algorithm
Notes on Analysis and Design
Home
Articles
Articles related to Algorithms and Design
Implementation
Implementation in C++ and Python
Languages
Nuances of Languages
Sorting
Selection Sort
Quick Sort
Bubble Sort
Merge Sort
Insertion Sort
Mathematics
Median of two sorted arrays
0-1 Knapsack
Xor of all subarrays Xor
Closest Pair(divide and Conquer Aprroach)
Permutation
Euclid(Computing GCD) Algorithm
N Queen Problem
Pythagorean Triplet
Sieve of Eratosthenes
Fundamental Theorem of Arithmetic
Fermat's Little Theorem
Queue
Stack Using Two Queues
Queue Using Two Stacks
Stack
Stack using Linked List
The Stock span Problem
Sorting Stack Using Recursion
Reverse Stack Using recursion
Next Greater Element
Implementing Two Stacks
Reverse string using stack
Equal Stack
Reverse Polish Notation
Stack using Array
Stack with GetMin() in O(1)
Stack Using Two Queues
Searching
Binary Search
Binary Search
Hashing
Hash Functions
String
Maximum Repeating Character
Longest Balanced Subsequence
Longest Common Subsequence
Naive Pattern Searching
Linked-list
Circular Linked List
Delete duplicate-value nodes
Compare Two Linked List
Tree
Max node in Tree
Checking Subtree
Ancestors of a node
nodes at distance k from the root
Max Width Of tree
Size of Tree
Max Depth of a tree
Level Order Traversal
Iterative inorder traversal
Tree Traversal
Geometric-algorithm
Closest Pair(divide and Conquer Aprroach)
Graph
Topological Sorting
FLoyd Warshall Algorithm
Depth First Traversal
Matrix
Sum of Division matrix
Search in a Sorted Matrix