creativites
BAN USER
Comments (5)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
whenever you have unsorted array you have to search it linearly until and unless there are any more conditions.
linear search will be O(n)
Chances of log(n) is too difficult.
i was also searching for the solution of the same question before but couldn't find 1.
Comment hidden because of low score. Click to expand.
0
of 0 vote
yeah.. true . But i have problem like if you reverse a number 2 times then we should get the same number.
But problem comes in case like this:
number=1230 reversed into =>0321 and if u reverse it again then we should get number=>1230.
Comment hidden because of low score. Click to expand.
0
of 0 vote
hey wat if i take num=0321. Then it shud convert it to 1230.
i tried my code but it is not converting the number to 1230.
and same problem i found with ur code.
Comment hidden because of low score. Click to expand.
0
of 0 vote
it will be 1..
- creativites September 30, 2009Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
Inserting data into binary Search tree will be O(n). So if you want to do the search in logn its of no use to do search after that.
- creativites May 18, 2011