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
高級樹,介紹各種高級樹的原理,如B+樹,策略樹,等
上傳時間： 2014-01-01
上傳用戶：牛布牛
本程序使用于愛思51-B型高級用戶板功能測試及演示,是用asm寫的，有要的朋友可以下下，
上傳時間： 2015-08-26
上傳用戶：lmeeworm
本文開發了一套基于J2EE技術的新兵思想評估系統。該系統基于多層B／S軟件架構，提高了系統的穩定性、靈活性及安全性；通過使用UML的系統分析，MVC、DAO等設計模式及面向對象（ＶＣ＋＋）的設計和開發，采用Spring、Hibernate、WebWork等框架技術，提高了開發的效率，為相關系統的設計開發探索了一條新思路。
上傳時間： 2013-12-24
上傳用戶：gxf2016
This is the machine-generated representation of a Handle Graphics object and its children. Note that handle values may change when these objects are re-created. This may cause problems with any callbacks written to depend on the value of the handle at the time the object was saved.
標簽： machine-generated representation Graphics children
上傳時間： 2013-12-18
上傳用戶：miaochun888
生產排程計劃的一份源碼.JAVA.B/S結構的。希望對一部分人有幫助
上傳時間： 2015-08-30
上傳用戶：小草123
database tools object 9
上傳時間： 2013-12-18
上傳用戶：fxf126@126.com
摘 要： 本文件是C8051單片機DA測試實驗程序；使用外部22.1184MHz晶振. 功能：定義 A ~ F 為功能鍵。 按"A" 鍵，輸出250HZ的方波，按"B" 鍵，輸出250HZ的正弦波形，按"C" 鍵，輸出250HZ的三角波， 按"D" 鍵，輸出250HZ的鋸齒波。用示波器在J6（DAC0）觀測結果，使用串口觀測按鍵信息。
上傳時間： 2014-01-17
上傳用戶：zxc23456789
BackProp算法：經典的B-P算法.
上傳時間： 2014-11-22
上傳用戶：xc216
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
標簽： Implemented following compile command
上傳時間： 2014-01-01
上傳用戶：lhc9102
