just fixing a bug what if you write bin_search as this //assumption array is in ascending order binsearch(high, low, key, a) begin if low > high return -1 mid = (high+low)/2 if a[mid] = key And (a[mid+1] > key||mid==high) return mid if a[mid] <= key low = mid+1 else high = mid - 1 return binsearch(high,low,key,a) end
On Mar 4, 3:46 pm, Kapil <[email protected]> wrote: > what if you write bin_search as this > //assumption array is in ascending order > binsearch(high, low, key, a) > begin > if low > high > return -1 > mid = (high+low)/2 > if a[mid] = key And a[mid+1] > key > return mid > if a[mid] <= key > low = mid+1 > else > high = mid - 1 > return binsearch(high,low,key,a) > end --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
