# Category Archives: Sorting

Given an array, arr[] containing n integers, the task is to find an integer (say K) such that after replacing each and every index of… Read More
Given an array arr[] of size N, Return the number of permutations of array arr[] which satisfy the condition arr & arr & . .… Read More
Given an integer N, denoting the size of a circular array containing non-zero elements and an array arr[] of size M having the indices of… Read More
Given an array A[] of length N, the task is to find the maximum sum calculated by multiplying subsequence sum with its length and removing… Read More
Balanced merge is a type of sorting algorithm where data is stored on multiple tapes (or other forms of storage). The tapes are divided into… Read More
What is BurstSort? BurstSort is an advanced sorting algorithm developed by Tony P. Hoare and Charles M. Payne in 1997. It is a hybrid of… Read More
Given two sorted arrays, the task is to merge them in a sorted manner.Examples:  Input: arr1[] = { 1, 3, 4, 5}, arr2[] = {2,… Read More
Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is… Read More
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