## Quotient – Remainder Sort

Quotient – Remainder Sort is a non-comparison based sorting algorithm. Steps to perform Quotient – Remainder sort as described below : Find MIN and MAX… Read More »

Quick Links for Sorting

Sorting Terminology |

Stability in sorting algorithms |

Time Complexities of all Sorting Algorithms |

External Sorting |

Quotient – Remainder Sort is a non-comparison based sorting algorithm. Steps to perform Quotient – Remainder sort as described below : Find MIN and MAX… Read More »

Given three sides of the triangle, find the minimum increase in the length of the side of the triangle to make the area of the… Read More »

Given a linked list of size N containing all values from 1 to N. The task is to sort the linked list in increasing order.… Read More »

Given a linked list. The task is to check if the linked list is pairwise sorted or not. A Linked List is considered pairwise sorted… Read More »

Given an array of pairs of integers. The task is to sort the array with respect to second element of the pair. Examples: Input: [(1,… Read More »

Given a matrix with N rows and M columns. The task is to print the index of columns of the given matrix based on the… Read More »

Given an integer array, sort the array according to the frequency of elements in decreasing order, if frequency of two elements are same then sort… Read More »

Given two arrays A and B of positive integers of the same size N. The task is to find the maximum sum of products of… Read More »

A sorting algorithm is said to be stable if it maintains the relative order of records in the case of equality of keys. Input :… Read More »

In this sorting algorithm, Hash Function f is used with the property of Order Preserving Function which states that if . Hash Function: f(x) =… Read More »

Given an array, we need to find the sum of elements of an array after changing the element as arr[i] will become abs(arr[i]-x) where x… Read More »

Given N points in K dimensional space where, and . The task is to determine the point such that the sum of Manhattan distances from… Read More »

Given N ranges and Q queries consisting of numbers. Every range consists of L and R. The task is to check if the given number… Read More »

Prerequisite :Merge Sort and Quick Sort Quick sort is an internal algorithm which is based on divide and conquer strategy. In this: The array of… Read More »

Write a function to implement quicksort algorithm that will work for all types of data i.e ints, floats, chars etc. It should accept all types… Read More »