Find the surpasser count for each element of an array

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.

Introsort Algorithm: Overview & Implementation

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 …