Input: A unsorted array of size n. Output: An array of size n. Relationship:
> elements of input array and output array have 1:1 correspondence. > output[i] is equal to the input[j] (j>i) which is smaller than input[i] and > jth is nearest to ith ( i.e. first element which is smaller). > If no such element exists for Input[i] then output[i]=0. Eg. Input: 1 5 7 6 3 16 29 2 7 Output: 0 3 6 3 2 2 2 0 0 -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.