奔向火星的博客

快速排序

插入排序

demo:#include <iostream>void bubbleSort(int a[], int size) { int i = 0, j = 0; for(i = 0; i < size; i++) { for(int j = i; j > 0; j--) { if(a[j] < a[j-1]) { in

demo:#include <iostream>void shellSort(int a[], int size) { int increase = size / 2; int i = 0, j = 0, k = 0, p = 0; for (; increase > 0; increase = increase / 2) { for (i = 0; i + i

一个优先队列的实现：#include <iostream>#define MAXSIZE 100typedef struct heap { int size; int capacity; int* a;}Heap;Heap heap;void initHeap() { heap.size = 0; heap.capacity = MAXSIZE;

demo如下：#include "iostream"#include <cstring>int tmp[100];void mergeSort(int a[], int size) { if (size <= 1) { return; } int* lp = a; int lSize = size / 2; int* rp = a + size