This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr
标签： introduction the contains intended
上传时间： 2013-12-23
上传用户：liansi
生成Bipartite Graphs ./distributions -u -m 1 -M 10 -n 100 -s 500 > top_distrib ./distributions -p -2.2 -m 1 -M 100 -n 200 -s 500 > bottom_distrib ./random_bipartite -t top_distrib -b bottom_distrib > bn_test
标签： distributions top_distrib Bipartite Graphs
上传时间： 2015-10-02
上传用户：yy541071797
palm编成,这种书很少,有兴趣看看 Title: Palm Programming: The Developer s Guide URL: http://safari.oreilly.com/JVXSL.asp?x=1&mode=section&sortKey=rank&sortOrder=desc&view=book&xmlid=1-56592-525-4&open=false&srchText=palm+programming&code=&h=&m=&l=1&catid=&s=1&b=1&f=1&t=1&c=1&u=1&page=0 ISBN: 1-56592-525-4 Author: Julie McKeehan/ Neil Rhodes Publisher: O Reilly Page: 478 Edition: 1st edition (December 1998) Catalog: PDA programming / Palm Format: pdf Size: 2.06M Supplier: Summary: Emerging as the bestselling hand-held computers of all time, PalmPilots have spawned intense developer activity and a fanatical following. Used by Palm in their developer training, this tutorial-style book shows intermediate to experienced C programmers how to build a Palm application from the ground up. Includes a CD-ROM with source code and third-party developer tools
标签： Programming Developer oreilly safari
上传时间： 2013-12-10
上传用户：litianchu
键盘任意输入一个稀疏矩阵A(m*n)，采用三元组存储方法求其转置矩阵B（n*m），并用快速转置算法实现该操作。
上传时间： 2013-12-08
上传用户：lingzhichao
Subroutine MCHOLSK :To solves a hermitian positive definite set of complex linear simultaneous equations (AX=B) using the Cholesky decomposition method.
标签： simultaneous Subroutine hermitian definite
上传时间： 2014-08-25
上传用户：windwolf2000
图论中最小生成树Kruskal算法 及画图程序 M-函数 格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图 例如 n=6 w=inf*ones(6) w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3] w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6 [a,b]=mintreek(n,w)
上传时间： 2015-11-30
上传用户：dreamboy36
The Original USB 2.0 specification released on April 27, 2000 Errata to the USB 2.0 specification as of December 7, 2000 Mini-B connector Engineering Change Notice to the USB 2.0 specification. Pull-up/pull-down Resistors Engineering Change Notice to the USB 2.0 specification. Errata to the USB 2.0 specification as of May 28, 2002 Interface Association Descriptor Engineering Change Notice to the USB 2.0 specification. Rounded Chamfer Engineering Change Notice to the USB 2.0 specification as of October 8, 2003 Unicode Engineering Change Notice to the USB 2.0 specification as of February 21, 2005 Inter-Chip USB Supplement Revision 1.0 as of March 13, 2006 Revision 1.3 of the USB On-The-Go Supplement as of December 5, 2006 Revision 1.01 of the Micro-USB Cables and Connectors Specification as of April 4, 2007 USB 2.0 Link Power Management Addendum Engineering Change Notice to the USB 2.0 specification as of July 16, 2007.
标签： specification 2.0 USB Original
上传时间： 2013-12-31
上传用户：familiarsmile
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
标签： represented integers group items
上传时间： 2016-01-17
上传用户：jeffery
单纯形法算法,int K,M,N,Q=100,Type,Get,Let,Et,Code[50],XB[50],IA,IAA[50],Indexg,Indexl,Indexe float Sum,A[50][50],B[50],C[50]
上传时间： 2013-12-22
上传用户：顶得柱
16 relay output channels and 16 isolated digital input channels LED indicators to show activated relays Jumper selectable Form A/Form B-type relay output channel Output status read-back Keep relay output values when hot system reset High-voltage isolation on input channels(2,500 VDC) Hi ESD protection(2,00VDC) High over-voltage protection(70VDC) Wide input range(10~50VDC) Interrupt handling capability High-density DB-62 connector Board ID
标签： channels indicators activated isolated
上传时间： 2016-02-15
上传用户：dongbaobao
