@anurag +1 On Mon, Aug 1, 2011 at 8:53 AM, Anurag atri <anu.anurag....@gmail.com>wrote:
> int Modified_BinarySearch(int A[], int N, int value) { > int low = 0; > int high = N; > while (low < high) { > int mid = (low + high)/2; > if (A[mid] < value) > low = mid + 1; > else > high = mid; > } > if ((low < N) && (A[low] == value)) > return low; > else > return -1; > } > > > Regards > Anurag Atri > > -- > 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. > -- Abhishek Gupta MCA NIT Calicut Kerela -- 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.