Huffman's Coding Greedy Algorithm

The prefix codes, means the codes (bit sequences) which are assigned in such a way that the code assigned to one character is not the prefix of code assigned to any other character. This is how the Huffman Coding makes sure that there is no ambiguity when decoding the generated bitstream.

Read More →

Floyd Warshalls Algorithm

Let the vertices of G be V = {1, 2........n} and consider a subset {1, 2........k} of vertices for some k. For any pair of vertices i, j ? V, considered all paths from i to j whose intermediate vertices are all drawn from {1, 2.......k}, and let p be a minimum weight path from amongst them. The Floyd-Warshall algorithm is known to exploits a link between path p and shortest paths from i to j with all intermediate vertices in the set {1, 2.......k-1}. The link depends on whether or not k is an intermediate between vertex of path p.

Read More →

Double Hashing Algorithm

Double hashing is a collision resolving technique in Open Addressed Hash tables. Double hashing uses the idea of applying a second hash function to key when a collision occurs.Double Hashing is one of the best techniques available for open addressing because the permutations produced have many of the characteristics of randomly chosen permutations.

Read More →

Dijkstra's Algorithm and Flow Chart with Implementation in Java

It is a famous solution for the shortest path problem was given by Dijikstras.It is a greedy algorithm that solves the single-source shortest path problem for a directed graph G = (V, E) with nonnegative edge weights, i.e., w (u, v) ? 0 for each edge (u, v) ? E.Dijkstra's Algorithm maintains a set S of vertices whose final shortest - the path weights from the source s have already been determined.

Read More →

Counting Sort Algorithm

The basic idea is to determine the "rank" of each number in the final sorted array. Counting Sort uses three arrays

Read More →

Algorithm and Flowchart for Area of Triangle

Simple Algorithm and Flowchart for Finding Area of Triangle

Read More →

Recovery tool for EDB to PST file.

EdbMails EDB to PST converter software which perfectly removes all errors and repair exchange database.

Read More →

The Missionary & Cannibals Problem

On 1 bank of a river are 3 missionaries and 3 cannibals. There is 1 boat available that can hold up to 2 people and that they would want to use it to cross the river. If cannibals do ever outnumber missionaries on either of the river’s edges, the missionaries will get eaten. How can the boat be used by the missionaries and cannibals to safely carry all of them across the river?

Read More →
Search

Play 2048 Game Online