and you made mistake above in calculating 12 + 2 = *12* , its 14
12 + 2 = 14, closest element found = 15 , closest to X = 15 - 2 = 13 , i
= 1, j = 4
12 + 3 = 15 , closest element found = 15 , closest to X = 15 - 3 =12 , i
= 2, j = 4
12 + 6 = 18 , closest element found = 15 , closest to X = 15 - 6 = 11 , i
= 3 , j = 4
12 + 10 = 22 , closest element found = 15 , closest to X = 15 - 10 = 5 , i
= 4 , j = 4
out of {10,13,12,11,5 } , element 12 is closest to X ( which is 12) .
So basically among this we have to find element closest X ( where element <
= X )
hence 12 is the answer.
On Thu, Dec 1, 2011 at 3:11 PM, atul anand <[email protected]> wrote:
> @sourabh
>
> i guess you need to modify this statement :-
>
> 3) Now for each element B[i][0] , do a (modified) binary *search for
> the closest value smaller than equal to (X + B[i][0])* in array B[i
> +1... n][0] ,
> Say the found index after binary search is j ( which is > i)...
>
> 12 + 2 = 12 , closest element found = 10 , closest to X = 10 - 2 = 8 , i
> = 1, j = 3
> 12 + 3 = 15 , closest element found = 15 , closest to X = 15 - 3 =12 , i =
> 2, j = 4
> 12 + 6 = 18 , closest element found = *no element found ??? how *
>
> *Cumulative SUM*
>
> *i*
>
> 2
>
> 0
>
> 3
>
> 1
>
> 6
>
> 2
>
> 10
>
> 3
>
> *15*
>
> 4
>
> for 12 + 6 =18 , closest element less than equal to 18 = 15 (15 < 18 )
> ..right ??
>
>
>
>
>
--
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.
