Test cases

Task 1

 section [krok4] of the 9.2.2 without table 9.4

 Task 2 

Table 9.4 and source code of the test program

Id	Input	Expected output	Covered elements
PT1	T = [4, 3]	T = [3, 4]	EP1, EP2, EP3, EP4, EP6, EP7, EP8, EP10
PT2	T = [3, 4, 5]	T = [3, 4, 5]	EP1, EP2, EP3, EP5, EP7, EP8, EP9, EP10

#include <stdbool.h>

void bubbleSort(int T[], int n) {
    bool swapped;
    int i, temp;

    do {
        swapped = false;
        for (i = 0; i < n - 1; i++) {
            if (T[i] > T[i + 1]) {
                temp = T[i];
                T[i] = T[i + 1];
                T[i + 1] = temp;
                swapped = true;
            }
        }
    } while (swapped);
}

int main() {
    int T1[] = {4, 3};
    int T2[] = {3, 4, 5};
    bubbleSort(T1, 2);
    bubbleSort(T2, 3);
    return 0;
}