Binary Search?

Short answer: Follow on: int BinarySearch(int[] arr, int target)

Example code

{
int low = 0, high = arr.Length - 1; while (low <= high) {
int mid = low + (high - low) / 2;
if (arr[mid] == target)
return mid; else if (arr[mid] < target) low = mid + 1; else high = mid - 1;
}
return -1;
} Explanation: Standard binary search to find target’s index or -1 if not found.

Real-world example (ShopNest)

In coding rounds, state complexity aloud, write a clear ShopNest-flavored example (orders, carts), then handle edge cases (empty list, null, overflow).

Say this in the interview

1. Define — one clear sentence (the short answer above).
2. Example — relate it to a project like ShopNest or your real work.
3. Trade-off — when you would not use it.