Given a sequence of numbers such that the difference between the consecutive terms is constant, find missing term in it in log(n) time.
In this post, we will discuss division of two numbers (integer or decimal) using Binary Search (Divide and Conquer) Algorithm.
Given a sorted array of integers, find floor and ceil of a given number in it. The floor and ceiling map the given number to the largest previous or the smallest following integer, respectively.
In this post, we will see how to sort an array of integers using iterative merge sort algorithm. Merge sort is an efficient sorting algorithm which falls under divide and conquer paradigm and produces a stable sort.
Given a sorted array containing duplicates, efficiently find frequency of each element in it without traversing the whole array.
Given an array of integers, find minimum and maximum element present in it by doing minimum comparisons.
Implement Quicksort algorithm using Hoare’s Partitioning scheme.
Implement Quicksort efficiently for inputs containing many repeated elements.
In this article, we will implement Ternary Search algorithm and compare its performance with Binary Search.
The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence’s elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous, or unique.
Given a linked list, sort it using merge sort algorithm. Email Address Merge sort algorithm is an efficient, general-purpose sorting algorithm which produces a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Merge sort is a comparison sort, i.e. it can sort items …
Given two integers x and n where n is non-negative, efficiently compute the value of power function pow(x, n).