When doing binary search related problems, I\'m always confused by two different ways of computing the `mid ` pointer.\n\nThe first one is `int mid = (i + j) / 2` and the second one is `int mid = i + (j - i) / 2`. \n\nWhat\'s the difference and how do I pick the right one to use?

When doing binary search related problems, I\'m always confused by two different ways of computing the mid pointer.\n\nThe first one is int mid = (i + j) / 2 an