2 nos with min diff given an array of size n. find 2 numbers from array whose difference is least in O(n) w/o using xtra space( i mean constant space)
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. 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.
