void TestBinarySearches () {
    ArraySequence<Student>* ArraySeq = new ArraySequence<Student>;
    Student student1 = Student("Maksim", 19); student1.set_flag(2); ArraySeq->Append(student1);
    Student student2 = Student("Dasha", 20); student2.set_flag(2); ArraySeq->Append(student2);
    Student student3 = Student("Alexey", 23); student3.set_flag(2); ArraySeq->Append(student3);
    Student student4 = Student("Vanya", 5); student4.set_flag(2); ArraySeq->Append(student4);
    Student student5 = Student("Slava", 18); student5.set_flag(2); ArraySeq->Append(student5);
    Student student6 = Student("Egor", 45); student6.set_flag(2); ArraySeq->Append(student6);
    Student student7 = Student("Nastya", 17); student7.set_flag(2); ArraySeq->Append(student7);
    Student student8 = Student("Semyon", 32); student8.set_flag(2); ArraySeq->Append(student8);
    Student student9 = Student("Andrey", 15); student9.set_flag(2); ArraySeq->Append(student9);
    Student student10 = Student("Kirill", 29); student10.set_flag(2); ArraySeq->Append(student10);
    MergeSort(ArraySeq);

    assert(BinarySearchBasic(ArraySeq, student4) == 0);
    assert(BinarySearchBasic(ArraySeq, student9) == 1);
    assert(BinarySearchBasic(ArraySeq, student6) == 9);

    assert(BinarySearchGoldenRatio(ArraySeq, student4) == 0);
    assert(BinarySearchGoldenRatio(ArraySeq, student9) == 1);
    assert(BinarySearchGoldenRatio(ArraySeq, student6) == 9);

    assert(BinarySearchFibonacciNumber(ArraySeq, student4, 5) == 0);
    assert(BinarySearchFibonacciNumber(ArraySeq, student9, 5) == 1);
    assert(BinarySearchFibonacciNumber(ArraySeq, student6, 5) == 9);

    vector<int> pair { 1, 4 };
    assert(BinarySearchOwnPair(ArraySeq, student4, pair) == 0);
    assert(BinarySearchOwnPair(ArraySeq, student9, pair) == 1);
    assert(BinarySearchOwnPair(ArraySeq, student6, pair) == 9);

    cout << "Автоматическое тестирование бинарных поисков пройдено" << endl;
}

void TestBTree () {
    ArraySequence<Student>* ArraySeq = new ArraySequence<Student>;
    Student student1 = Student("Maksim", 19); student1.set_flag(2); ArraySeq->Append(student1);
    Student student2 = Student("Dasha", 20); student2.set_flag(2); ArraySeq->Append(student2);
    Student student3 = Student("Alexey", 23); student3.set_flag(2); ArraySeq->Append(student3);
    Student student4 = Student("Vanya", 5); student4.set_flag(2); ArraySeq->Append(student4);
    Student student5 = Student("Slava", 18); student5.set_flag(2); ArraySeq->Append(student5);
    Student student6 = Student("Egor", 45); student6.set_flag(2); ArraySeq->Append(student6);
    Student student7 = Student("Nastya", 17); student7.set_flag(2); ArraySeq->Append(student7);
    Student student8 = Student("Semyon", 32); student8.set_flag(2); ArraySeq->Append(student8);
    Student student9 = Student("Andrey", 15); student9.set_flag(2); ArraySeq->Append(student9);
    Student student10 = Student("Kirill", 29); student10.set_flag(2); ArraySeq->Append(student10);

    BTreeBuilder<Student> builder = BTreeBuilder<Student> (2);
    BTree<Student> btree = builder.build(ArraySeq, ArraySeq->getLength(), 2);

    assert(btree.search(student1).index == 0);
    assert(btree.search(student2).index == 1);
    assert(btree.search(student3).index == 0);
    assert(btree.search(student4).index == 0);
    assert(btree.search(student5).index == 0);
    assert(btree.search(student6).index == 0);
    assert(btree.search(student7).index == 2);
    assert(btree.search(student8).index == 2);
    assert(btree.search(student9).index == 1);
    assert(btree.search(student10).index == 1);

    btree.remove(student8);
    assert(btree.search(student10).index == 2);
    cout << "Автоматическое тестирование B-дерева пройдено" << endl;


}