СПРИНТ № 6 | Просто о сложности. Теория быстродействия | Урок 6: Логарифмическая сложность

#include <iostream>

using namespace std;

template<typename F>
int FindFloor(int n, F m) {
    int low = 1;
    int high = n;

    while (low < high) {
        int mid = (high + low) / 2;
        if (m(mid)) {
            high = mid;
        }
        else {
            low = mid + 1;
        }
    }
    return low;
}
int main() {
    int n, t;
    cout << "Enter n and target floor number: "s << endl;
    cin >> n >> t;
    int count = 0;

    int found = FindFloor(n, [t, &count](int f) {
        ++count;
        return f >= t;
             });

    cout << "Found floor "s << found << " after "s << count << " drops"s;

    return 0;
}