冒泡和快排数据元素交换过程

#include<iostream>
#include<windows.h>
using namespace std;

void swap(int *arr, int i, int j){
    int temp = arr[i];
    arr[i] = arr[j];
    arr[j] = temp;
}

void printArray(int *arr, int n, int flag1, int flag2){
    for(int i = 0; i < n; i ++){
        if(arr[i] != flag1 && arr[i] != flag2){
            SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_GREEN);
            //设置成绿色
            cout<<arr[i]<<" ";
        }
        else{
            SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_RED);
            //设置成红色，表示交换的两个值
            cout<<arr[i]<<" ";
        }
    }
    cout<<endl;
}

//冒泡排序
void bubbleSort(int *arr, int n){
    for(int i = n - 1; i > 0; i --){
        bool flag = false;//记录每一趟排序是否有交换
        for(int j = 0; j < i; j ++){
            bool subFlag = false;//记录每一趟中的每一轮是否有交换
            int temp = 0;
            if(arr[j] > arr[j + 1]){
                swap(arr[j], arr[j + 1]);
                flag = true;
                subFlag = true;
            }
            if(subFlag)//如果该趟中的该轮有交换，则打印出来
                printArray(arr, n, arr[j], arr[j + 1]);
        }
        if(flag == false)//如果该趟没有排序，说明数组已经有序
            break;
    }
}


//划分函数，用于快速排序
int partition(int *arr, int left, int right, int n){
    int pivot = arr[left];
    while(left < right){
        while(left < right && arr[right] > pivot)
            right --;
        while(left < right && arr[left] < pivot)
            left ++;
        if(left < right){
            swap(arr, left, right);//有交换就打印出来
            printArray(arr, n, arr[left], arr[right]);
        }
    }
    //swap(arr,arr[left],pivot);
    //printArray(arr, n, arr[left], pivot);
    return left;
}

//快速排序
void quickSort(int *arr, int left, int right, int n){
    if(left >= right)
        return;
    int pivotPos = partition(arr, left, right, n);
    quickSort(arr, left, pivotPos - 1, n);
    quickSort(arr, pivotPos + 1, right, n);
}

int main()
{
    int arr[10] = {1,4,0,3,5,9,2,8,6,7};

    cout<<"=============冒泡排序============="<<endl;
    printArray(arr, 10, -1, -1);//打印出原序列
    bubbleSort(arr,10);
    for(int i = 0; i < 10; i ++)
        cout<<arr[i]<<" ";
    cout<<endl<<endl;

    cout<<"=============快速排序============="<<endl;
    int arr2[10] = {1,4,0,3,5,9,2,8,6,7};
    printArray(arr2, 10, -1, -1);//打印出原序列
    quickSort(arr2, 0, 9, 10);
    for(int j = 0; j < 10; j ++)
        cout<<arr2[j]<<" ";
    cout<<endl;
    return 0;
}