ccyanxyz的博客

经典整数划分问题递归图解

归并排序的递归实现与循环实现：#include <stdio.h>#include <stdlib.h>#include <math.h>#define min(x, y) (x) > (y) ? (y) : (x)int *newArray(int n);void mergeSort(int *array, int n);void merge(int *array, int *arr

选择排序较为简单，复杂度O（n^2)，不稳定排序算法，实现如下：#include <stdio.h>#define MAX 100int main(){ int i, j, temp, n, index; int a[MAX]; printf("Input n:\n"); scanf("%d", &n); for(i = 0; i < n; i++)

冒泡排序，复杂度O(n^2)，过程可形象地比作冒泡（小数上冒，大数下沉（从大到小排序）），也较为简单，实现如下：#include <stdio.h>#define MAX 100int main(){ int i, j, temp, n; int a[MAX]; printf("Input n:\n"); scanf("%d",&n); for(i = 0;

插入排序实现：#include <stdio.h>#include <stdlib.h>void insertionSort(int *array, int n);int main(){ int i, n, *array; printf("Input n:\n"); scanf("%d", &n); array = malloc(sizeof(int) * n

快速排序，分治法思想，递归实现：#include <stdio.h>#include <stdlib.h>void quickSort(int a[], int low, int high);int main(){ int n, i; printf("Input n:\n"); scanf("%d", &n); int *a = malloc(sizeof(in