Binary Search LeetCode solution in C++

1
class Solution {
2
 public:
3
  int search(vector<int> &nums, int target) {
4
    int n = nums.size();
5
    int jump = 5;
6
    int p = 0;
7
    while (jump * 5 < n) jump *= 5;
8
    while (jump > 0) {
9
      while (p + jump < n && nums[p + jump] <= target) p += jump;
10
      jump /= 5;
11
    }
12
    return (p == n || nums[p] != target) ? -1 : p;
13
  }
14
};