Algorithm
文章平均质量分 73
wyc1230
这个作者很懒,什么都没留下…
展开
-
Algorithem Review: Binary Search Tree(Insert, Delete, Search, Balance, PreOrder, InOrder, PostOrder)
#include#include#include#includeusing namespace::std;typedef struct Node{ Node(int input):data(input),visit(0),lChild(NULL),rChild(NULL),parent(NULL){} int data; bool visit; Node* lChild;原创 2012-07-19 22:05:24 · 1127 阅读 · 0 评论 -
Graph Algorithms: Implementation& DFS& Strong Component& BFS & Dijkstra & Bellman Ford
#include#include#include#include#include using namespace::std;class Node;class Edge{public: Edge(Node* start, Node* end, int _cost = 0):from(start),to(end),cost(_cost) {} Node *原创 2012-06-28 01:27:36 · 531 阅读 · 0 评论 -
Algorithms Review: Divide and Conquer(Binary Search & Merge Sort)
#include#include#include#include#include using namespace::std;class DivideAndConquer{public: int binarySearch(int target, int* inputArray, int size) { if(size < 1) { cout<<"error"<<e原创 2012-07-15 02:31:56 · 465 阅读 · 0 评论 -
Trie
http://en.wikipedia.org/wiki/Trie原创 2015-03-25 14:38:59 · 573 阅读 · 0 评论 -
汉诺塔(hanoi)算法实现
#include#include#include#include#include #include using namespace::std;class Solution {public: Solution():n(2) { stack tower1; stack tower2; stack tower3; hanoi.push_back(tower1); ha原创 2012-06-13 10:31:06 · 2796 阅读 · 0 评论 -
Algorithm Review: Sorting
参考资料:http://blog.csdn.net/touch_2011/article/details/6767673// 选择排序、快速排序、希尔排序、堆排序不是稳定的排序算法,而冒泡排序、插入排序、归并排序和基数排序是稳定的排序算法。#include#include#includeusing namespace::std;/*性能分析容易看出,简单选择排序所需进行记原创 2012-08-30 10:33:52 · 533 阅读 · 0 评论 -
Segment Tree and Binary index tree
Segment Tree:http://www.geeksforgeeks.org/segment-tree-set-1-sum-of-given-range/http://www.geeksforgeeks.org/segment-tree-set-1-range-minimum-query/Binary Indexed Tree:http://www.geeks原创 2016-06-23 10:46:14 · 1148 阅读 · 0 评论