Banoo

2010-01-31 22:54:11 UTC

hi,

can you help me solve the following problem?

You are given an unsorted list of n-1 distinct integers from the range

1 to n. Write a linear-time algorithm to find the missing integer.

Thanks

can you help me solve the following problem?

You are given an unsorted list of n-1 distinct integers from the range

1 to n. Write a linear-time algorithm to find the missing integer.

Thanks

--

You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.

To post to this group, send email to algogeeks-/JYPxA39Uh5TLH3MbocFF+G/***@public.gmane.org

To unsubscribe from this group, send email to algogeeks+unsubscribe-/JYPxA39Uh5TLH3MbocFF+G/***@public.gmane.org

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-/JYPxA39Uh5TLH3MbocFF+G/***@public.gmane.org

To unsubscribe from this group, send email to algogeeks+unsubscribe-/JYPxA39Uh5TLH3MbocFF+G/***@public.gmane.org

For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.