多线程实现冒泡，快速排序

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


#define LENGTH 8
int BubbleRandom[LENGTH],QuickRandom[LENGTH];   

int count=0,count1=0;

HANDLE a;                   //创建句柄
DWORD WINAPI BubbleThread(LPVOID n); //冒泡排序
DWORD WINAPI QuickThread(LPVOID n); //快速排序

void BubbleSort(int *BubbleRandom,int m)                           //冒泡排序算法
{
int i,j,exchange;
int tmp;
for(i=0;i<=m-1;i++)
{
exchange=0;
for(j=m-1;j>=i;j--)
{
if(BubbleRandom[j]<BubbleRandom[j-1])
{
WaitForSingleObject(a,INFINITE); //等待全局参数a
Sleep(100);
tmp=BubbleRandom[j];
BubbleRandom[j]=BubbleRandom[j-1];

BubbleRandom[j-1]=tmp;
exchange=1;
count++;

if(count1<count&&count<10)
{
cout<<"冒泡排序 第 "<<count<<"步后的结果：";
for(int k=0;k<m;k++)
{
cout<<BubbleRandom[k]<<" ";
}
cout<<endl;
}
else if(count1<count&&count>=10)
{
cout<<"冒泡排序 第"<<count<<"步后的结果：";
for(int k=0;k<m;k++)
{
cout<<BubbleRandom[k]<<" ";
}
cout<<endl;
}
else
{
cout<<"冒泡排序 第"<<count<<"步后的结果：";
for(int k=0;k<m;k++)
{
cout<<BubbleRandom[k]<<" ";
}