资源列表
linear
- Recursive divide and conquer algorithm with linear time selection
C
- 要了解指针,多多少少会出现一些比较复杂的类型,所以我先介绍 一下如何完全理解一个复杂类型,要理解复杂类型其实很简单,一 个类型里会出现很多运算符,他们也像普通的表达式一样,有优先 级,其优先级和运算优先级一样,所以我总结了一下其原则: 从变量名处起,根据运算符优先级结合,一步一步分析. 下面让我们先从简单的类型开始慢慢分析吧:-the intruduce of c and c++ ,especially the piont
QQSafePro
- 全自动修改QQ密码，使用前只需要填入你的账号信息即可。-QQ automatic password change, the use of the former only need to enter your account information.
DataBaseToExecl
- 把数据库资料导入Excel中的两种方法，本人学习过程留下的笔记。跟大家分享一下。-DataBase to Excel
gmail_sender
- 自己用C#写的GMAIL的*程序.很不错-C# to write their own use GMAIL for mass programs. Very good
StringOscillations(working)
- This program discribes oscillation of a string in step by step method. It can be run on the mathmatical software "Mathematica"
xxxaRgci
- visual basic制作的工程字模软件-font software engineering led
word
- 计算大整数乘法，可以实现解决int形无法储存的数据，使用C-Calculation of large integer multiplication, can solve the int data type can not be saved, the use of C++
Fast_Fourier_Transform
- FFT algorithm is implemented in VC-FFT algorithm is implemented in VC++
Cppt4
- C语言老师上课的课件,这个老师的教课很好的说,希望对大家有所帮助.-C language teacher in the class of the courseware, the teacher to teach well said, we want to help.
beibaowenti
- 有N件物品和一个容量为V的背包。第i件物品的费用是c[i]，价值是w[i]。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。-With N items and a capacity of V backpack. S i is the cost of items c [i], value w [i]. Solving the items into the bag which allows the cost of these items does not exceed t
Cpractise1
- 这是C语言老师给我们出的习题及其答案,希望对大家有用!-This is the C language teachers gave us exercises and answers, and I hope useful!