public static int introTutorial(int V, List<Integer> arr) {
    int left = 0;
    int right = arr.size() - 1;

    while (left <= right) {
        int pivot = (left + right) / 2;
        int pivotValue = arr.get(pivot);

        if (V == pivotValue) {
            return pivot;
        }
        if (V < pivotValue) {
            right = pivot - 1;
        } else {
            left = pivot + 1;
        }
    }

    return -1;
}

public static int introTutorial(int V, List<Integer> arr) {
    return arr.indexOf(V);
}

int introTutorial(int V, vector<int> arr) {
    for(int i = 0; i < arr.size(); i++) if(arr[i] == V) return i;
    return 0;
}

int introTutorial(int V, vector<int> arr) {
    return distance(arr.begin(), find(arr.begin(), arr.end(), V));
}

def introTutorial(V, arr):
    for i in range(len(arr)):
        if (arr[i]==V):
            print(i)
            return i

int introTutorial(int V, int size, int* arr) {
    int first = 0, last = size - 1, middle = 0, index = -1;
    while(last >= first)
    {
        middle = (last+first)/2;
        if (arr[middle] == V)
        {
            index = middle;
            break;
        }
        else if(arr[middle] > V)
        {
            last = middle - 1;
        }
        else if(arr[middle] < V)
        {
            first = middle + 1;
        }
    }
    return index;
}