---------- Forwarded message ----------
From: sivaviknesh s <sivavikne...@gmail.com>
Date: Mon, Jul 18, 2011 at 11:29 PM
Subject: Fwd: MICROSOFT INTERNSHIP (Coding round)
To: algogeeks@googlegroups.com
---------- Forwarded message ----------
From: subramania jeeva <subramaniaje...@gmail.com>
Date: Thu, Sep 23, 2010 at 7:53 AM
Subject: Re: MICROSOFT INTERNSHIP (Coding round)
To: mitcse08i...@googlegroups.com
Also in placement the question asked was
Given a 2 dimensional matrix with its rows and columns are in
sorted order. You've to find a number and return its positions from that
matrix... I think the efficient way is binary search... It'll take log(n^2)
to the base 4.
Mostly they're expecting C code rather than C++.... So
improve your C knowledge..
say........
1 2 3
4 5 6
7 8 9
...say u ve to find '8'....
start from 1 ...check its right (2) nd down (4)
4>2 (but 4<8)....so go to 4....again check its right (5) nd down (7)
7>5....finally reached 8 in four steps....complexity is less than o(m*n)...
...am i rite???
Cheers
~ Jeeva ~
--
Regards,
$iva
--
Regards,
$iva
--
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.
