算法
不归客
这个作者很懒,什么都没留下…
展开
-
排序算法一:冒泡排序
#include <stdio.h>#include <stdlib.h>#include <string.h>void show(int *num, int len){ int i; for (i = 0; i < len; i++) printf("%3d", num[i]); printf("\n...原创 2018-09-23 11:14:34 · 306 阅读 · 0 评论 -
排序算法二:快速排序
#include <stdio.h>#include <stdlib.h>#include <string.h>#include <time.h> #define LEN 50 void swap(int *a, int *b){ int temp; temp = *a; *a = *b; *b = temp;}...原创 2018-09-23 11:17:23 · 189 阅读 · 0 评论 -
排序算法三:归并排序
#include <stdio.h>#include <stdlib.h>#include <string.h>#include <time.h>#define LEN 20void merge(int *num, int start, int mid, int end){ int len1 = mid - start +...原创 2018-09-23 11:35:20 · 189 阅读 · 0 评论 -
排序算法四:插入排序
#include <stdio.h>#include <time.h>#define N 16#define MAX 100void init_array(int a[], int len){ int i; srand(time(NULL)); for(i = 0;i < len; i++) a[i] = ran...原创 2018-09-23 11:43:37 · 225 阅读 · 0 评论 -
排序算法五:选择排序
#include <stdio.h>#include <time.h>#define N 16#define MAX 100void init_array(int a[], int len){ int i; srand(time(NULL)); for(i = 0;i < len; i++) a[i] = ra...原创 2018-09-23 11:46:38 · 222 阅读 · 0 评论 -
排序算法六:单链表的排序
#include <iostream>using namespace std;typedef struct Node{ int data; struct Node *next;} node;int lenList(node *head){ if (head == NULL) return 0; node *p = head; int len = 0; ...原创 2018-09-23 11:49:46 · 18844 阅读 · 3 评论 -
排序算法七:排序二叉树
#include <stdio.h>#include <stdlib.h>#include <string.h>#include <assert.h>#include <time.h>#define TREE_TYPE inttypedef struct TREE_NODE { TREE_TYPE value;...原创 2018-09-23 12:02:21 · 692 阅读 · 0 评论