Vikas is right!
while (n) is equal to (while n!=0)
you have 2n compares!
בתאריך יום שני, 1 באוקטובר 2012 12:12:21 UTC+2, מאת vikas:
still there is no improvement, compiler will generate the code to compare
with zero here. what you have accomplished is , hide it from human eyes
On Monday, 1
you mean like scramble ?
On Jun 5, 5:39 am, Ashish Goel ashg...@gmail.com wrote:
preparing a sample itself is a great problem here, that is why i called it
hard
all words in the rectangle horizontally as well as vertically needs to be
valid dictionary words
Ashish
Hassan
say this
with the address
of any node of list two. The first matching address will be the output.
The worst case running time of this algo will be O(n^2)
On Tue, May 1, 2012 at 8:47 PM, rafi rafiwie...@gmail.com wrote:
i dont understan if i look in the pic i attached then the length of
the first
tnx
On 1 מאי, 18:04, Bhupendra Dubey bhupendra@gmail.com wrote:
start from head of both and as soon as one of the list is empty means you
hit null
start counting the remaining number of nodes in the other list till that
gets empty.
Now the number obtained above is the difference in
i dont understan if i look in the pic i attached then the length of
the first list is 5 and the length of the second list is 6.
what should i do now?
if i traverse the long list 5,6 nodes i dont get to the red node.
what am i missing?
On 1 מאי, 18:04, Bhupendra Dubey bhupendra@gmail.com
i don't think it's possible (almost sure)
On Mar 17, 3:41 pm, rahul sharma rahul23111...@gmail.com wrote:
guys do we have algo to remove duplicates in o(n) time and in spce
comepexity 0(1)...in unsorted...array or string.???
--
You received this message because you are subscribed to the
http://thenewboston.org/list.php?cat=6 have lots of android tutorials
On Jan 3, 11:41 am, atul anand atul.87fri...@gmail.com wrote:
develop application like SIRI ... can be used by blink people bcoz
touchscreen application will be useless from them.
--
You received this message because you
