Skip to content

Category Archives: Sorting

Given an array arr[] of size N. Make the array arr[] sorted in non-decreasing order in the minimum number of operations where you can choose… Read More
Given a string of lowercase characters from ‘a’ – ‘z’. We need to write a program to print the characters of this string in sorted… Read More
What is Parallel Count Sort? Parallel count sort is an efficient algorithm that sorts an array of elements in a parallel manner. It is a… Read More
The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning.… Read More
Insertion sort is a simple sorting algorithm that works similar to the way you sort playing cards in your hands. The array is virtually split… Read More
Given a 2D array, sort each row of this array and print the result.Examples:  Input: 77 11 22 3 11 89 1 12 32 11… Read More
Given an array arr[] of size N, where each value represents the number of elements present of the ith type, the task is to find… Read More
Given an array arr[] of size N having positive elements, the task is to find the minimum number of deletion or append operations to make… Read More
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

Start Your Coding Journey Now!