We can modify the array. The algorithm should work even if we use
unsigned integers and N is the largest unsigned integer.
Don
On Oct 30, 4:42 pm, rahul sharma <rahul23111...@gmail.com> wrote:
> Can we modify the array???we can make index we visit as negative and then
> if any one already containing -ve..then its repeating
>
>
>
>
>
>
>
> On Wed, Oct 31, 2012 at 1:40 AM, Don <dondod...@gmail.com> wrote:
> > Does your algorithm work if N=4 and the array is {1,1,2,2}.
>
> > Don
>
> > On Oct 30, 2:32 pm, arumuga abinesh <arumugaabin...@gmail.com> wrote:
> > > if sum of all elements = n(n-1)/2 , no elements are repeated
> > > else some numbers are repeated
>
> > > On Tue, Oct 30, 2012 at 11:57 PM, Don <dondod...@gmail.com> wrote:
> > > > Given an array of N integers in the range 0..N-1, determine if any
> > > > number is repeated in the array.
> > > > Solution should execute in O(n) time and use constant space.
> > > > Don
>
> > > > --
> > > > 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.
>
> > --
> > 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.
--
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.
