u r right payal but can u expln o(n) time complexity...... On Sun, Mar 11, 2012 at 6:10 PM, payal gupta <[email protected]> wrote:
> By Augmented BST- > TC-O(n) > > > On Sun, Mar 11, 2012 at 3:08 PM, Gaurav Popli <[email protected]>wrote: > >> given an array of size n... >> create an array of size n such that ai where ai is the element in the >> new array at index location i is equal to sum of all elements in >> original array which are smaller than element at posn i... >> >> e.g >> ar[]={3,5,1,6,7,8}; >> >> ar1[]={0,3,0,9,15,22}; >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Regards.... Sanjiv Yadav MobNo.- 8050142693 Email Id- [email protected] -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
