数据结构
文章平均质量分 74
zhouzp15
这个作者很懒,什么都没留下…
展开
-
单向链表归并排序
struct Node { int data; Node *next; Node (int data = 0, Node *next = NULL) : data(data), next(next) {} }; Node *merge(Node *p, Node *q) { Node *pos = NULL, *head = NULL; while (p || q)原创 2016-09-06 09:12:19 · 282 阅读 · 0 评论 -
QT多线程快速排序
//MyThread.h #ifndef MYTHREAD_H #define MYTHREAD_H #include #include #include class MyThread : public QThread { Q_OBJECT public: MyThread(int lo, int hi, QObject *parent = 0); ~MyThr原创 2016-09-06 09:17:55 · 1440 阅读 · 0 评论 -
QT多线程归并排序
//work.h #ifndef WORK_H #define WORK_H #include #include #include struct Node { int key, val; Node *next; Node(int key = 0, int val = 0, Node *next = NULL) : key(key), val(va原创 2016-09-06 09:36:53 · 610 阅读 · 0 评论