qucik sort c++

// ConsoleApplication1.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <stdio.h>
#include <iostream>
using namespace std;
void Print(int*num, int n)
{
    int i;
    for (i = 0; i < n; i++)
        printf("%d ", num[i]);
    puts("\n");
    return;
}
void Bubble_sort(int *num, int n){
    int i, j;
    for (i = 0; i < n; i++)
    {
        for (j = 0; i+j < n-1; j++){
            if (num[j]>num[j+1]){
                int temp = num[j];
                num[j] = num[j+1];
                num[j+1] = temp;
            }
            
        }
        Print(num, n);
    }
}
void Quick_sort(int *num,int left,int right){
    if (left < right){
        int key = num[left];  //key is the base number
        int low = left;
        int high = right;
        while (low != high){
            // search the number larger than it from right 
            while (num[high] >= key&&low < high)
                high--;
            //search the number smaller than it from left 
            while (num[low] <= key&&low < high)
                low++;
            //change the position of two array and in order to divide them into two parts according to base number,left is small,and right is big.
            if (low < high)
            {
                int temp = num[low];
                num[low] = num[high];
                num[high] = temp;
            }
        }
        //set the base number and recursive method to deal with two parts
        num[left] = num[low];
        num[low] = key;
        Quick_sort(num, left, low - 1);
        Quick_sort(num, low + 1, right);
    }
    

}
int _tmain(int argc, _TCHAR* argv[])
{
    int a;
    int x[10] = { 31,65,82,76,13,27,10,3,2,1 };
    Quick_sort(x, 0, 9);
    Print(x, 10);
    cin >> a;
    return 0;
    
}