@amit did u got any solution ??
On Sun, Jul 11, 2010 at 7:29 PM, amit <amitjaspal...@gmail.com> wrote:
> You have an array like ar[]= {1,3,2,4,5,4,2}. You need to create
> another array ar_low[] such that ar_low[i] = number of elements lower
> than or equal to ar[i] in ar[i+1:n-1].
> So the output of above should be {0,2,1,2,2,1,0}
>
> Time complexity : O(n)
> use of extra space allowed.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com>
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
With Regards,
Jalaj Jaiswal
+919026283397
B.TECH IT
IIIT ALLAHABAD
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
