If an array is rotated a number of unknown times , then how to find an
element in O(log n)
For the above question, is the array already sorted???
On Mon, Aug 22, 2011 at 2:50 PM, vikas vikas.rastogi2...@gmail.com wrote:
using interval tree/segment tree will solve this in straightforward
Explanation please
On Fri, Aug 12, 2011 at 9:33 AM, Dipankar Patro dip10c...@gmail.com wrote:
b.
On 11 August 2011 23:20, arvind kumar arvindk...@gmail.com wrote:
b.
On Thu, Aug 11, 2011 at 11:18 PM, Mani Bharathi
manibharat...@gmail.comwrote:
int(* fun()) [row][ Col];
What
We can do it in just one pass.
Start scanning the array and whichever element gets scanned just store some
kind of marker in the additional array that this element has been
vsisted.Next time you get some element if that element (or character) is not
visited earlier than mark it as visited and
Sukhmeet can you please explain your approach ?
On Fri, Jun 17, 2011 at 3:48 PM, sukhmeet singh sukhmeet2...@gmail.comwrote:
Can be done by any standard disk scheduling methods.. i guess
On Tue, Jun 14, 2011 at 2:01 PM, Akshata Sharma akshatasharm...@gmail.com
wrote:
Design an elevator
Can someone please explain how is this working ??
On Thu, Jun 2, 2011 at 11:24 PM, Harshal hc4...@gmail.com wrote:
what do they want to test by asking such a question!
On Thu, Jun 2, 2011 at 11:17 PM, Senthil S senthil2...@gmail.com wrote:
Output
Hello! how is this? super
That is C!
Can you please tell What are we testing here ?.
I mean to ask what is the output of the function..
On Thu, Jun 2, 2011 at 7:49 PM, Ashish Goel ashg...@gmail.com wrote:
Given a function to draw a circle with input paramters as co-ordinates of
centre of the circle and r is the radius of the
