Counting pairs in array | Letuscode
Given an array A of distinct numbers, how to count the number of pairs (i,j) such that
A[i] < A[j]
For example, let us consider A = [2, 1, 3]
the pairs are (1,2), (1,3), (2,3). So there are 3 pairs.
Similarly for A = [10, 6, 9, 2], there are 6 pairs
Read full article from Counting pairs in array | Letuscode
No comments:
Post a Comment