Skip to content

Category Archives: Sorting

What is Sorting? Arranging data in an increasing or decreasing fashion according to their values is called Sorting.  Below are shown some processes for sorting… Read More
What is Bingo Sort? This Sorting Technique is similar to the Selection Sort in which we first find the smallest element called Bingo Element, and… Read More
Prerequisite:  SORT command in Linux/Unix with examples The SORT command in the Linux operating system is used for sorting. It can be done either for… Read More
You are given an array of Email IDs, the task is to return the lexicographically first email ID of every single domain. Examples: Input: Emails[]… Read More
Given an array arr[] of size N and you need to fill another empty array of size N with positive integers. Each element in the… Read More
QuickSort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the pivot. There are many… Read More
You are given X[] of length 2*N, Where N will always be odd, the task is to construct an array Y[] of length N from… Read More
We have two standard sorting algorithms, named bucket sort and radix sort. They both share differences and similarities. Let’s explore some similarities, differences, advantages, and… Read More
Given an array arr[] of size N and a non-negative integer K, the task is to find the length of the longest subsequence such that… Read More
There is only one room which is holding N meetings that are given as intervals of the form (start[i], end[i], people[i]) where start[i] is the… Read More
Given an array stream of n integers in the form of a stream, the task is to find the minimum number of operations that are… Read More
What are sorting networks in parallel computing? Sorting networks are comparison networks that always sort their inputs. They are also known as comparison networks. Comparison… Read More
Given two arrays A[] and B[] of size N and M respectively denoting the required elements of each group and the number of elements in… Read More
Given an input arr[] of length N, Which contains integers from 1 to N in unsorted order. You can apply only one type of operation… Read More
Given an array of positive integer arr[] of length N and an integer Z, (Z > arr[i] for all 0 ≤ i ≤ N –… Read More

Start Your Coding Journey Now!