## Count Sort – C++ and Java Implementation

Given an array of integers, effectively sort it using count sort algorithm.

Coding made easy

Given an array of integers, effectively sort it using count sort algorithm.

Given an array of integers having distinct elements, find the surpasser count for each element in it. In other words, for each element of the array, find the number of elements to its right which are greater than it.

Given M sorted lists of variable length, print them in sorted order efficiently.

Given an array of integers, sort it using introsort sorting algorithm. Introsort is an efficient in-place sorting algorithm, which usually beats all other sorting algorithms in terms of performance. Due to its high performance, it is used in a number of standard library sort functions, including some C++ sort implementations. Introsort is a comparison …

Given a collection of n items, each of which has a non-negative integer key whose maximum value is at most k, effectively sort it using counting sort algorithm.

Given an array with many duplicated elements, write an algorithm to efficiently sort it in linear time where the order of equal elements doesn’t matter.

Implement Quicksort efficiently for inputs containing many repeated elements.

Quicksort performance can be boosted in several ways. In this post, we will cover few of them.

Given a schedule containing arrival and departure time of trains in a station, find minimum number of platforms needed in the station so to avoid any delay in arrival of any train.

Given a set of intervals, print all non-overlapping intervals after merging overlapping intervals.

Given an array of integers, find the smallest window in array sorting which will make the entire array sorted in increasing order.

Find largest number possible from set of given numbers. The numbers should be appended to each other in any order to form the largest number.