suppose an array A[0...n-1] given have to buld another array B[0..n-1] such
that B[i] hold the number of lower or equal values in Right side of A[i]. in
O(nlgn) please post solution . example if A{1,2,0,7,3} so B will be
{1,1,0,1,0} .
--
You received this message because you are subscribed to
you can use mergesort technique, segment tree, binary index tree or BST
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
