#include <iostream>
#include <string>
#include <vector>
#include <ctime>
#include <cstdlib>
#include <algorithm>

void printVector(std::vector<int>& vect) {
    for (auto obj : vect) {
        std::cout << obj << "\t";
    }
    std::cout << std::endl;
}

int cmp (int a, int b) { return a < b ? true : false; }

int binarySearch(std::vector<int>& vector, int key, int lBorder, int rBorder) {
    if (rBorder - lBorder >= 0) {
        int middle = (lBorder + rBorder) / 2;
        if (key == vector[middle]) {
            return middle;
        } else if (key < vector[middle]) {
            binarySearch(vector, key, lBorder, middle - 1);
        } else {
            binarySearch(vector, key, middle + 1, rBorder);
        }
    } else {
        return -1;
    }
}

int main() {
    srand(time(NULL));
    std::vector<int> objVector;
    for (size_t i = 0; i < 10; ++i) {
        objVector.push_back(std::rand()%100);
    }
    printVector(objVector);
    std::sort(objVector.begin(), objVector.end(), cmp);
    printVector(objVector);
    int key = INT_MIN;
    std::cin >> key;
    int index = binarySearch(objVector, key, 0, objVector.size());
    std::cout << "Index of founded element (if it isn't exist you'll see -1)\t" << index << std::endl;
    return 0;
}