algorithms and data structures
文章平均质量分 76
Rauber_Hotzenplotz
这个作者很懒,什么都没留下…
展开
-
Undirected graphs representation
http://www.algolist.net/Data_structures/Graph/Internal_representationclass Graph {private: bool** adjacencyMatrix; int vertexCount;public: Graph(int vertexCount) {转载 2011-12-01 23:13:05 · 499 阅读 · 0 评论 -
双向链表
http://www.cprogramming.com/snippets/source-code/double-linked-list-cplusplusThis snippet submitted by Ali Murad on 2012-03-10. It has been viewed 3838 times.Rating of 9 with 20 votes转载 2012-09-25 11:20:27 · 898 阅读 · 0 评论 -
Maximum Profit in a Stock Market
Source:http://programming4interviews.wordpress.com/category/dynamic-programming/Given a week`s daily prices of a stock, find out the days in which we should buy and sell the stocks such that t转载 2012-10-03 20:47:24 · 564 阅读 · 0 评论 -
Reverse a linked list
source: http://www.geeksforgeeks.org/archives/860Write a function to reverse a linked listAugust 2, 2009Iterative MethodIterate trough the linked list. In loop, change next t转载 2012-09-27 13:57:46 · 487 阅读 · 0 评论 -
Dijkstra算法
http://2728green-rock.blog.163.com/blog/static/43636790200901211848284/2.2 Dijkstra算法思想Dijkstra算法思想为:设G=(V,E)是一个带权有向图,把图中顶点集合V分成两组,第一组为已求出最短路径的顶点集合(用S表示,初始时S中只有一个源点,以后每求得一条最短路径 , 就将 加入到集合S中,直到全转载 2012-04-02 10:47:46 · 570 阅读 · 0 评论 -
二叉堆 & 堆排序
http://blog.csdn.net/zhongjiekangping/article/details/6953973堆排序与快速排序,归并排序一样都是时间复杂度为O(N*logN)的几种常见排序方法。学习堆排序前,先讲解下什么是数据结构中的二叉堆。二叉堆的定义二叉堆是完全二叉树或者是近似完全二叉树。二叉堆满足二个特性:1.父结点的键值总是大于或等于(小于或等于)任何一个子转载 2012-01-30 05:58:30 · 487 阅读 · 0 评论 -
红黑树
http://blog.csdn.net/zhongjiekangping/article/details/6934571红黑树是一种自平衡二叉查找树,是在计算机科学中用到的一种数据结构,典型的用途是实现关联数组。它是在1972年由Rudolf Bayer发明的,他称之为"对称二叉B树",它现代的名字是在 Leo J. Guibas 和 Robert Sedgewick 于1978年写的一篇论转载 2012-01-30 06:57:39 · 1144 阅读 · 0 评论 -
Recursion
http://www.w17x.com/AritcleDisplay.aspx?id=639The underlying concept is to decompose a big problem into indivisible sub-problems, solve them and then combine each of these partial solutions to get t转载 2012-01-28 01:55:09 · 565 阅读 · 0 评论 -
树的遍历
http://baike.baidu.com/view/1455146.htm 前序遍历(DLR) 前序遍历也叫做先根遍历、先序遍历,可记做根左右。 前序遍历首先访问根结点然后遍历左子树,最后遍历右子树。在遍历左、右子树时,仍然先访问根结点,然后遍历左子树,最后遍历右子树。 若二叉树为空则结束返回,否则: (1)访问根结点.转载 2012-01-21 06:01:18 · 344 阅读 · 0 评论 -
Pigeonhole Principle
http://en.wikipedia.org/wiki/Pigeonhole_principleIn mathematics and computer science, the pigeonhole principle states that if n items are put intom pigeonholes with n > m, then at least one转载 2011-12-15 01:00:01 · 1340 阅读 · 0 评论 -
Euclidean Algorithm
http://dict.youdao.com/w/euclidean_algorithm/#q%3Dbk%253A%25E8%25BE%2597%25E8%25BD%25AC%25E7%259B%25B8%25E9%2599%25A4%25E6%25B3%2595%26keyfrom%3Dwiki.related%26le%3Deng辗转相除法, 又名欧几里德算法(Euclidean algo转载 2011-12-15 00:50:31 · 596 阅读 · 0 评论 -
Simple Queue Impliment in C
http://ben-bai.blogspot.com/2012/04/simple-queue-data-structure-in-ansi-c.html转载 2014-11-13 13:37:32 · 681 阅读 · 0 评论