qt多线程实现快速排序和冒泡排序方法二

qt5多线程处理方式

#include "mainwindow.h"
#include "ui_mainwindow.h"
#include "mythread.h"
#include <QThread>

MainWindow::MainWindow(QWidget *parent)
    : QMainWindow(parent)
    , ui(new Ui::MainWindow)
{
ui->setupUi(this);

// 1. 创建子线程对象
QThread* t1 = new QThread;
QThread* t2 = new QThread;
QThread* t3 = new QThread;

// 2. 创建任务类的对象
Generate* gen = new Generate;
BubbleSort* bubble = new BubbleSort;
QuickSort* quick = new QuickSort;

// 3. 将任务对象移动到某个子线程中
gen->moveToThread(t1);
bubble->moveToThread(t2);
quick->moveToThread(t3);


connect(this, &MainWindow::starting, gen, &Generate::working);
// 2. 启动子线程
connect(ui->start, &QPushButton::clicked, this, [=]()
    {
emit starting(10000);
t1->start();
    });
connect(gen, &Generate::sendArray, bubble, &BubbleSort::working);
connect(gen, &Generate::sendArray, quick, &QuickSort::working);
// 接收子线程发送的数据
connect(gen, &Generate::sendArray, this, [=](QVector<int> list){
t2->start();
t3->start();
for(int i=0; i<list.size(); ++i)
        {
ui->randList->addItem(QString::number(list.at(i)));
        }
    });
connect(bubble, &BubbleSort::finish, this, [=](QVector<int> list){
for(int i=0; i<list.size(); ++i)
        {
ui->bubbleList->addItem(QString::number(list.at(i)));
        }
    });
connect(quick, &QuickSort::finish, this, [=](QVector<int> list){
for(int i=0; i<list.size(); ++i)
        {
ui->quickList->addItem(QString::number(list.at(i)));
        }
    });

connect(this, &MainWindow::destroy, this, [=]()
    {
t1->quit();
t1->wait();
t1->deleteLater();  // delete t1;

t2->quit();
t2->wait();
t2->deleteLater();

t3->quit();
t3->wait();
t3->deleteLater();

gen->deleteLater();
bubble->deleteLater();
quick->deleteLater();
    });

}

MainWindow::~MainWindow()
{
delete ui;
}

#include "mythread.h"
#include <QElapsedTimer>
#include <QDebug>
#include <QThread>

Generate::Generate(QObject *parent) : QObject(parent)
{

}

void Generate::working(int num)
{
qDebug() << "生成随机数的线程的线程地址: " << QThread::currentThread();
QVector<int> list;
QElapsedTimer time;
time.start();
for(int i=0; i<num; ++i)
    {
list.push_back(qrand() % 100000);
    }
int milsec = time.elapsed();
qDebug() << "生成" << num << "个随机数总共用时:" << milsec << "毫秒";
emit sendArray(list);
}

BubbleSort::BubbleSort(QObject *parent) : QObject(parent)
{

}

void BubbleSort::working(QVector<int> list)
{
qDebug() << "冒泡排序的线程的线程地址: " << QThread::currentThread();
QElapsedTimer time;
time.start();
int temp;
for(int i=0; i<list.size(); ++i)
    {
for(int j=0; j<list.size()-i-1; ++j)
        {
if(list[j] > list[j+1])
            {
temp = list[j];
list[j] = list[j+1];
list[j+1] = temp;
            }
        }
    }
int milsec = time.elapsed();
qDebug() << "冒泡排序用时" << milsec << "毫秒";
emit finish(list);
}

QuickSort::QuickSort(QObject *parent) : QObject(parent)
{

}

void QuickSort::working(QVector<int> list)
{
qDebug() << "快速排序的线程的线程地址: " << QThread::currentThread();
QElapsedTimer time;
time.start();
quickSort(list, 0, list.size()-1);
int milsec = time.elapsed();
qDebug() << "快速排序用时" << milsec << "毫秒";
emit finish(list);
}

void QuickSort::quickSort(QVector<int> &s, int l, int r)
{
if (l < r)
    {
int i = l, j = r;
// 拿出第一个元素, 保存到x中,第一个位置成为一个坑
int x = s[l];
while (i < j)
        {
// 从右向左找小于x的数
while (i < j && s[j] >= x)
            {
//左移, 直到遇到小于等于x的数
j--;
            }
if (i < j)
            {
//将右侧找到的小于x的元素放入左侧坑中, 右侧出现一个坑
//左侧元素索引后移
s[i++] = s[j];
            }

// 从左向右找大于等于x的数
while (i < j && s[i] < x)
            {
//右移, 直到遇到大于x的数
i++;
            }
if (i < j)
            {
//将左侧找到的元素放入右侧坑中, 左侧出现一个坑
//右侧元素索引向前移动
s[j--] = s[i];
            }
        }
//此时 i=j,将保存在x中的数填入坑中
s[i] = x;
quickSort(s, l, i - 1); // 递归调用
quickSort(s, i + 1, r);
    }
}