人大经济论坛 › 标签 › Algorithms

标签: Algorithms经管大学堂：名校名师名课

相关帖子	版块	作者	回复/查看	最后发表

一种与文本无关的说话人验证模型：比较分析	外文文献专区	大多数88 2022-3-8	0 194	大多数88 2022-3-8 13:33:25
范数-积信念传播：原始-对偶信息传递近似推论	外文文献专区	大多数88 2022-3-8	0 308	大多数88 2022-3-8 13:08:50
DM好书---Data Mining : Concepts, Models, Methods, and Algorithms	计量经济学与统计软件	eijuhz 2005-5-12	18 6437	jennylujiayin 2017-3-13 15:34:50
【独家发布】Algorithms: Sequential, Parallel, and Distributed	休闲灌水	sutonghua 2013-6-9	3 1643	Lucian713 2016-3-13 14:31:40
[下载]Algorithms and Data Structures in C++	计量经济学与统计软件	fengyun8323 2007-8-16	6 3941	floydgyf 2014-2-15 00:01:13
[下载]Information Theory, Inference, and Learning Algorithms	R语言论坛	caocheng8230 2008-9-29	3 4283	yulai860 2012-5-14 23:26:23
Springer - Kernel Based Algorithms for Mining Huge Data Sets - 2006	经济金融数学专区	Yuhanjlu 2009-6-19	3 2009	m8843620 2012-2-21 10:25:20
Financial Engineering and Computation - Principles, Mathematics and Algorithms b	金融学（理论版）	laueddy 2007-4-19	0 5059	laueddy 2011-11-21 14:56:40
[再来][下载]Financial Engineering and Computation: Principles, Mathematics, and Algo	金融学（理论版）	batsmile 2006-2-8	11 4167	xuning 2011-10-14 05:56:37
Monte Carlo, Concepts,Algorithms & Applications第4部分	计量经济学与统计软件	casa 2005-5-16	1 2549	constant 2011-10-4 05:54:20
Monte Carlo, Concepts,Algorithms & Applications	计量经济学与统计软件	casa 2005-5-16	17 4910	volleyball 2011-10-4 05:50:02
[下载]Practical Genetic Algorithms	金融学（理论版）	martinnyj 2009-4-21	1 1711	zhiwei0501 2009-4-21 19:08:00
[下载]Solutions for Introduction to algorithms	金融学（理论版）	sogol001 2009-4-11	0 3234	sogol001 2009-4-11 15:43:00
[下载]Mathematical Finance: Core Theory, Problems and Statistical Algorithms	金融学（理论版）	martinnyj 2009-4-8	0 2115	martinnyj 2009-4-8 13:47:00
The Mathematics of Derivatives Tools for Designing Numerical Algorithms	金融学（理论版）	bukeyide111 2009-2-5	0 2348	bukeyide111 2009-2-5 17:02:00
下载 Stochastic Simulation Algorithms and Analysis, Springer (2007)	金融学（理论版）	huiyuank 2008-10-1	0 4334	huiyuank 2008-10-1 02:07:00
[下载]Financial Enginneering & Computation - Principles, Mathematics & Alg	金融学（理论版）	bona 2008-8-9	0 2838	bona 2008-8-9 20:18:00
[推荐]Encyclopedia of Algorithms 数学算法百科全书	金融学（理论版）	bundy 2008-7-2	0 3658	bundy 2008-7-2 16:27:00
[推荐][下载]07新书Stochastic Simulation: Algorithms and Analysis	金融学（理论版）	bundy 2008-3-9	1 4507	hoopmat 2008-3-9 15:39:00
求中文书籍关于GA的－－GENETIC ALGORITHMS	计量经济学与统计软件	sunnychristmas 2005-11-12	0 2268	sunnychristmas 2005-11-12 07:15:00

更多...

相关日志

分享 Trees in Algorithm: jessicamadu 2013-2-12 14:50; Definition for trees is simple, here we discuss the difference between Binary trees and Binary Search Trees. Binary Trees : Binary tree is a set of nodes that is either empty or consists of a root and two disjoint binary trees called left and right subtrees. Binary Search Tree :It is a binary tree,it may be empty ,if it's not empty, then it satisfies the following properties: 1.Every element has a key and no two elements have the same key. 2.All keys in the left subtree(if any) are smaller than the key in the root. 3.All keys in the right subtree(if any) are greater than the key in the root. 4.The left and right subtrees are also binary search trees. Binary Heap: A binary heap is a complete binary tree and satisfies two constraints 1. All levels of the tree, except possibly the last one(deepest) are fully filled, and , if the last level of the tree is not complete, the nodes of that level are filled from left to right. 2. Each node is greater than or equal to each of its children(max heap). Algorithm1: Recursive search of a binary search tree Since the definition of binary search tree is recursive, it is easiest to describe a recursive search method. Algorithm search(t,x) { if(t=0) then return 0; else if(x=t-data) then return x; else if(xt-data) then return search(t-lchild,x); else return search(t-rchild,x); } Algorithm2: Insertion into a binary search tree Algorithm Insert(x) { found=false; p=tree; while((p!=0) and not found) do { q=p; //Save p. if(x=(p-data)) then found=true; else if(x(p-data)) then p=(p-lchild); else p=(p-rchild); } if(not found) then { p=new TreeNode; p-lchild=0; p-rchild=0; p-data=x; if(tree!=0)then { if(x(q-data)) then (q-lchild)=p; else (q-rchild)=p; }else tree=p; } }; 个人分类: Fundamentals of Algorithms|7 次阅读|0 个评论