Relearn bubble sort

Bubble sort is an algorithm that we have learned when we started learning programming. Today, we will rewrite the algorithm we have learned before.

index is the end of our next loop.

#includeusing namespace std;void so(int a[]){int index = 10;int j;int co = 1;bool flag = true;for(int i = 0; i < 10; i++) cin >> a[i];while(flag){j = -1;for(int i = 0; i < index; i++){if(a[i] > a[i + 1]) {swap(a[i],a[i + 1]);j = i + 1;cout << "No." << co++ << "Order: ";for(int i = 0; i < 10; i++) cout << a[i] << " " ;puts("");}if(i == index - 1) index = j;}if(j == -1){flag = !flag;cout << "Sort done";}}}int main(){int a[100];so(a);return 0;}