Bubble Sort

void sort() {
    for(int i = 0; i < N; ++i) {
        for(int j = i + 1; j < N; ++j) {
            if (data[i] > data[j]) {
                auto tmp = data[i];
                data[i] = data[j];
                data[j] = tmp;
            }
        }
    }
}

Time Complexity

• Average: $O(N^2)$
• Worst: $O(N^2)$