Ans 7:
Why am I getting such an answer!!
[co-ordinates] next_step_size
[-2, -2] 5
[-4, -4] 9
[-6, -6] 13
[-8, -8] 17
[-10, -10] 21
[-12, -12] 25
[-14, -14] 29
[-16, -16] 33
[-18, -18] 37
[-20, -20] 41
[-22, -22] 45
[-24, -24] 49
[-26, -26] 53
[-28, -28] 57
[-30, -30] 61
[-32, -32] 65
[-34, -34] 69
[-36, -36] 73
[-38, -38] 77
[-40, -40] 81
[-42, -42] 85
[-44, -44] 89
[-46, -46] 93
[-48, -48] 97
[-50, -50] 101
[-52, -52] 105
[-54, -54] 109
[-56, -56] 113
[-58, -58] 117
[-60, -60] 121
[-62, -62] 125
[-64, -64] 129
[-66, -66] 133
[-68, -68] 137
[-70, -70] 141
[-72, -72] 145
[-74, -74] 149
[-76, -76] 153
[-78, -78] 157
[-80, -80] 161
[-82, -82] 165
[-84, -84] 169
[-86, -86] 173
[-88, -88] 177
[-90, -90] 181
[-92, -92] 185
[-94, -94] 189
[-96, -96] 193
[-98, -98] 197
[-100, -100] 201
[-102, -102] 205
[-104, -104] 209
[-106, -106] 213
[-108, -108] 217
[-110, -110] 221
[-112, -112] 225
[-114, -114] 229
[-116, -116] 233
[-118, -118] 237
[-120, -120] 241
[-122, -122] 245
[-124, -124] 249
[-126, -126] 253
[-128, -128] 257
[-130, -130] 261
[-132, -132] 265
[-134, -134] 269
[-136, -136] 273
[-138, -138] 277
[-140, -140] 281
[-142, -142] 285
[-144, -144] 289
[-146, -146] 293
[-148, -148] 297
[-150, -150] 301
Hence answer should be 150km south, 150km west..!!!
-2,2 - - - 1,2
| |
| |
| 0,0 - 1,0
|
-2,-2
On Sep 19, 7:48 pm, Ankur Garg <[email protected]> wrote:
> Q9 - > 1 *logn for getting the minimum element ..Normal heap Sort procedure
>
> Q3 - > n+logn-2 comparisions so 51 -2 + log 51
>
> Regards
> Ankur
>
>
>
>
>
>
>
> On Mon, Sep 19, 2011 at 7:59 PM, Ashima . <[email protected]> wrote:
> > m getting result in 95 matches
>
> > Ashima
> > M.Sc.(Tech)Information Systems
> > 4th year
> > BITS Pilani
> > Rajasthan
>
> > On Mon, Sep 19, 2011 at 7:07 PM, malay chakrabarti
> > <[email protected]>wrote:
>
> >> i have explained :)
>
> >> On Sun, Sep 18, 2011 at 11:53 PM, Ashima . <[email protected]> wrote:
>
> >>> @malay: how cm n+logn-2?
> >>> cn u explain the logic ?
>
> >>> Ashima
> >>> M.Sc.(Tech)Information Systems
> >>> 4th year
> >>> BITS Pilani
> >>> Rajasthan
>
> >>> On Sun, Sep 18, 2011 at 11:07 AM, Ashima . <[email protected]>wrote:
>
> >>>> rite! 62.5%
>
> >>>> Ashima
> >>>> M.Sc.(Tech)Information Systems
> >>>> 4th year
> >>>> BITS Pilani
> >>>> Rajasthan
>
> >>>> On Sat, Sep 17, 2011 at 9:04 PM, malay chakrabarti
> >>>> <[email protected]>wrote:
>
> >>>>> create a tournament tree.in each round one value is eliminated to
> >>>>> obtain in the process the winner or the highest value in n-1
> >>>>> comparisons.
> >>>>> Then check the queue of the winner which contains log(n) entries of the
> >>>>> values beaten by the winner which implicitly will contain the runners
> >>>>> up.Then log(n)-1 comparisons to find the highest among all the losers
> >>>>> whom
> >>>>> the winner had beaten. So all over complexity will be n-1 +log(n) -1 =
> >>>>> n+log(n)-2. Hp that answers ur query. nice question btw :)
>
> >>>>> On Sun, Sep 18, 2011 at 8:02 AM, VIHARRI <[email protected]>wrote:
>
> >>>>>> hey i'm also thinking n + logn -2.. but couldnt able to figure out
> >>>>>> how??? can you please explain the logic
>
> >>>>>> --
> >>>>>> 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.
>
> >>> --
> >>> 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.
>
> > --
> > 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.
