pediy_yuhan的专栏

priority_queue.h #ifndef PRIORITY_QUEUE_H_INCLUDED #define PRIORITY_QUEUE_H_INCLUDED #include #include #include #include #include using namespace std; namespace algo { /// @brief 优先队列

quick_sort.cpp #include #include #include #include #include using namespace std; namespace algo { /// 随机采样快排 平均效率O(nlgn)且常数因子很小 最坏效率O(n^2) void QuickSort(vector &toSort,int beginIndex,

linear_sort.cpp #include #include #include #include #include using namespace std; namespace algo { /// 计数排序 void CountingSort(vector &ivec,int maxsize,int n) { for(int i=0;

hash_table.cpp #include #include #include #include #include #include using namespace std; namespace algo { template class UniversalHashTable { public: UniversalHashTab

binary_search_tree.cpp #include #include #include #include using namespace std; namespace algo { template class BinarySearchTree { private: struct _Node {

red_black_tree.cpp #include #include #include #include using namespace std; namespace algo { /// @param TKey 节点键的类型 /// @param TValue 节点值的类型 template class RBTree { public: enum RBTre