游戏猫的博客

一、排序算法常见的内部排序算法有：选择排序、插入排序、冒泡排序、计数排序、归并排序、快速排序、堆排序、基数排序、希尔排序等。文本不介绍堆排序、基数排序、希尔排序。二、算法性能比较排序算法平均时间复杂度最小时间复杂度最大时间复杂度适用场景选择排序O(N^2)O(N^2)O（N^2无脑排序，性能差插入排序O(N^2)O(N)O(N^2)某几个位置...

说明：采用和Redis排序算法类似的跳表，支持大量数据的实时排序。public class SkipListLevelInfo where T : class{ public SkipListNode Next; public uint Span;}public class SkipListNode where T : class{ public T Item

public class QuadTreeNode { public const int LT = 0; public const int RT = 1; public const int LB = 2; public const int RB = 3; public List dataList;

一、UniteFind.h源码#pragma once#include "stdafx.h"class UniteFind{private : int* nodeRoot; int* treeHeight; int nodeNum; int findRoot(int node) { while (nodeRoot[node] != no

A*寻路算法源码Astar.h源码#pragma once#include "stdafx.h"#include "MinHeap.h" //最小堆源码地址http://blog.youkuaiyun.com/heyaolongsanhao/article/details/53437325class AstarNodeRun;class Astar;class AstarRunData;class

最小堆MinHeap源码MinHeap.h源码#pragma once#include "stdafx.h"#include <vector>using namespace std;class MinHeapNode{private: int _nodeIndex; float _nodeValue;public: MinHeapNode(float node

最大堆MaxHeap源码MaxHeap.h源码#pragma once#include "stdafx.h"#include <vector>using namespace std;class MaxHeapNode{private: int _nodeIndex; float _nodeValue;public: MaxHeapNode(float node

QuickSort快速排序源码QuickSort.h源码#include "stdafx.h"template<typename T> class QuickSort{private: static bool Compare(T a, T b, bool useDesc) { return useDesc?(a >= b) : (a <= b); }

二叉排序树（AVL树）源码AVLTree.h源码#pragma once#include "stdafx.h"#include <vector>using namespace std;class AVLNode{public: float nodeValue; int treeHeight; AVLNode* lChild; AVLNode* rChild

四叉树QuadTree源码QuadTree.h源码#include "stdafx.h"#include <list>using namespace std;struct QuadAABB{public: int left; int top; int width; int height; int right; int bottom;

线段树源码SegmentTree.h源码#pragma once#include "stdafx.h"class SegmentTreeNode{public: int min; int max; double coverWeight; double containWeight; //部分覆盖+全部覆盖 SegmentTreeNode* left;

Dijkstra算法源码Dijkstra.h文件源码#pragma once#include "stdafx.h"#include <vector>using namespace std;//arcs中arcs[i][j] < 0,表示不可达class Dijkstra{private: int _num; float** _arcs; float* _dis;