![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
Chris_秦
nihao
展开
-
排序算法 C语言实现 总结
个人在学习算法时总结的部分代码头文件Sort.h#ifndef _SORT_H_#define _SORT_H_#include <stdio.h>#include "time.h"#include "stdlib.h"#include "ASSERT.h"#include "arithmetic.h"typedef int TYPE; void insertionSor原创 2017-03-14 19:24:33 · 411 阅读 · 0 评论 -
算法之二分搜索树C语言实现
头文件 binarySearch.h#ifndef BINARYSEARCH_H_INCLUDED#define BINARYSEARCH_H_INCLUDED#include "stdbool.h"#include "stddef.h"#include "stdlib.h"#include "ASSERT.h"typedef struct Node{ int key; i原创 2017-03-14 19:32:50 · 1284 阅读 · 0 评论 -
算法之栈的实现2
头文件 indexHeap.h#ifndef INDEXHEAP_H_INCLUDED#define INDEXHEAP_H_INCLUDED#include <stdio.h>#include "time.h"#include "stdlib.h"#include "ASSERT.h"#include "arithmetic.h"typedef struct{ int *data原创 2017-03-14 19:35:34 · 174 阅读 · 0 评论 -
算法之堆的实现
头文件 Heap.c#ifndef _HEAP_H_#define _HEAP_H_#include <stdio.h>#include "time.h"#include "stdlib.h"#include "ASSERT.h"#include "arithmetic.h"typedef struct{ int *data; int heapMaxIndex; in原创 2017-03-14 19:38:24 · 209 阅读 · 0 评论 -
算法之并查集 C语言实现2
头文件 UnionFind2.h#ifndef UNIONFIND2_H_INCLUDED#define UNIONFIND2_H_INCLUDED#include "stdlib.h"#include "ASSERT.h"typedef struct{ int* parent; int count;}Union;void unionFind2Init(Union *un,原创 2017-03-14 19:43:37 · 399 阅读 · 0 评论 -
算法之并查集 C语言实现3
头文件 UnionFind3.h#ifndef UNIONFIND3_H_INCLUDED#define UNIONFIND3_H_INCLUDED#include "stdlib.h"#include "ASSERT.h"typedef struct{ int* parent; int* rank;//rank[i]表示以i为根的集合中树的层数 int count;原创 2017-03-14 19:45:27 · 3323 阅读 · 0 评论 -
算法之并查集 C语言实现1
头文件 UnionFind.h#ifndef UNIONFIND_H_INCLUDED#define UNIONFIND_H_INCLUDED#include "stdlib.h"#include "ASSERT.h"typedef struct{ int* id; int count;}Union;void unionFindInit(Union *un,int n);原创 2017-03-14 19:41:26 · 1618 阅读 · 0 评论