Latest Algorithms

Breadth First Traversal

Admin | 31-Jan-2017 | C#, VB.Net, C, C++

Breadth first traversal, also known as breadth first search or BFS, is an algorithm for traversing or searching tree or graph data structures. It ...

Depth First Traversal

Admin | 31-Jan-2017 | C#, VB.Net, C, C++

Depth first traversal, also known as depth first search or DFS, is an algorithm for traversing or searching tree or graph data structures. One starts ...

Linear Search

Admin | 30-Jan-2017 | C#, VB.Net, C, C++, PHP

Linear search, also known as sequential search is an algorithm for finding a target value within a list. It sequentially checks each element of the ...

Interpolation Search

Admin | 30-Jan-2017 | C#, VB.Net, C, C++, PHP

Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this ...

Median Of Two Sorted Arrays

Admin | 04-Jan-2017 | C#, VB.Net, C, C++

This algorithm finds the median of two sorted arrays by first getting medians of the two sorted arrays and then comparing them.

Anagram Substring Search

Admin | 29-Dec-2016 | C#, VB.Net, C, C++, PHP

This algorithm searches for all the occurrences of pattern and its permutations (or anagrams) in the specified text.

Atbash Cipher Helper

Vitaly Kopytich | 20-Dec-2016 | PHP

Atbash is a mono-alphabetic substitution cipher originally used to encode the Hebrew alphabet. It can be modified for use with any known alphabet. ...

Optimal Mismatch Algorithm

Admin | 13-Dec-2016 | C#, VB.Net, C, C++

This algorithm works by scanning pattern characters from the least frequent one to the most frequent one. Doing so one may hope to have a mismatch ...

Transposition Cipher

Admin | 06-Oct-2016 | C#, VB.Net, C, C++, PHP

In cryptography, a transposition cipher, also known as columnar transposition cipher, is a simple and easy to implement cipher. This cipher follows a ...

N Queen Problem

Admin | 09-Jul-2016 | C#, VB.Net, C, C++, PHP

The N Queen, also known as eight queens puzzle, is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each ...