http://silyeek-tech.blogspot.com
--~--~-~--~~~---~--~~
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
I'm sorry, but the response below is wrong on several levels. See
notes.
C Erler wrote:
> Because there are infinite integers, there is no need for a list of
> 4,300,000,000 of them to contain a duplicate. If there are
> 4,299,999,999 choices, there will be one duplicate. Because the
> solutio
Because there are infinite integers, there is no need for a list of
4,300,000,000 of them to contain a duplicate. If there are
4,299,999,999 choices, there will be one duplicate. Because the
solution uses binary search, the list is sorted.
So, the full problem is probably something like the fol
This problem is from the book programming pearls . Can anyone explain
me the soln. How does he do it.
Given a file containing 4,300,000,000 integers, how
can you find one that appears at least twice?
Binary search finds an element that occurs at least twice by
recursively
searching the subint
This problem is from the book programming pearls . Can anyone explain
me the soln. How does he do it.
Given a file containing 4,300,000,000 integers, how
can you find one that appears at least twice? (Explain, first,
why this must happen.)
Binary search finds an element that occurs at least t
> I know HOW the algorithms work, but I can't get my head around the
> scientific argument for WHY they work. I don't need a mathematical
> proof, just a short (if possible) argument.
>
A* simply works using relaxation. You relax the currently explored
paths to find an upper bound on that path. T
yes
most importantly main function is a user defined function...
On 5/14/06, Arulanandan P <[EMAIL PROTECTED]> wrote:
hi , Can any one let me , is it possible to write C programs without main() function.. If it is possible then how do we change the start up routine which transfer the control
