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

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

Cpp Program Code:

This program uses a nested loop to compare each element of the array with every other element to its right and count the number of elements greater than it. The result is stored in a vector and printed at the end. The time complexity of this program is O(n^2).

Python Program code:

This program uses a nested loop to compare each element of the array with every other element to its right and count the number of elements greater than it. The result is stored in a list and printed at the end. The time complexity of this program is O(n^2).