Yeah..agree with this... Just find minimum no and increment that..! Any counter-example??
On Saturday, 10 September 2011 01:19:41 UTC+5:30, hashd wrote: > > For question 2 I guess finding the minimum element's index should suffice > (considering all elements are positive integer). No need to even calculate > n! as it might cause overflow in case the arrary is big. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/PY1okbjIwNoJ. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
