You are given two arrays A and B, each of which contains n distinct integers. Design...

 

Transcribed Image Text:

You are given two arrays A and B, each of which contains n distinct integers. Design an algorithm to count the number of pairs (i, j), 1<i,j<n, satisfying that A[i] <A[j] and B[i] < B[j]. Your algorithm should run in O(nlogn) time. You are given two arrays A and B, each of which contains n distinct integers. Design an algorithm to count the number of pairs (i, j), 1<i,j<n, satisfying that A[i] <A[j] and B[i] < B[j]. Your algorithm should run in O(nlogn) time.