Heap sort is a sorting algorithm based on comparing elements in a Binary Heap data structure. We first find the maximum element and place...

This algorithm is best suited when memory writes or swap operations are costly. It is a sorting algorithm that changes values in place....

Caesar Cipher is one of the earliest encryption methods, apparently used by Julius Caesar. It is simple to use and implement, and even...

The Comb Sort Algorithm is very similar to Bubble Sort. It is used to sort an array, by comparing values. The difference is that Count...

Counting Sort algorithm is used to sort elements of an array, that are placed between a small range. The values can repeat them self. It...

The Bucket Sort algorithm is used for sorting arrays that have values equally distributed inside a range. We create a few buckets for...

Bubble Sort algorithm is the simplest sorting algorithm. It compares each value with the adjacent value. If the second value is smaller...

The Ternary Search is a divide and conquer algorithm, very similar to binary search. It can find a value in a sorted array, by slitting...

Linear Search is a simple way to search for a value in an array. It looks through the values in the array one by one and compares them to...

Jump Search is an algorithm used to find a value in an ordered array of elements. Its main purpose is to do as few searches as possible....

Interpolation Search algorithm is used to search for a value in an ordered, uniformly distributed array of elements. Interpolation Search...

Exponential search is an algorithm used for finding a value in an array. The array must be ordered. This algorithm is based on the Binary...

The binary search algorithm is widely used in programming. It requires that the array in which we search for the value to be sorted. So,...