资源列表
plmsandndnsjndasjndj
- some idiotic work pls dont open
0.618
- 0.618法——研究生优化设计课程里面一种传统的优化方法，方法简单，易学，此文件仅作编程交流。-0.618- Graduate optimized design course inside a traditional optimization methods, the method is simple, easy to learn, this document is for the exchange program.
Lista-1---Raphaella-MN
- Code LU decomposition developed in MatLab
gupiao
- 输入某股票的持有量以及股票的价格，包括价格的分子和分母部分。输出股票的价格-Input of a certain stock holdings and stock prices, including the numerator and denominator of the price part. The output price of the stock
tongzhang
- 输入一件商品去年和今年的价格，然后计算去年到近年的通胀率-An input commodity prices last year and this year, and then calculate the rate of inflation last year in recent years
root
- 一个很小的程序，主要是用二分法求方程的根，适合初学者-A small program, the main dichotomy is the root of Equation for beginners
qiuzhishu
- 这个程序能求出求出一到所输入数值之间的所有质数！-This program can find the find the one entered into between the value of all prime numbers!
TIME
- 完成日期和时间模块的算法代码，包括闰年，月份天数，小时分钟秒的进位交接。-Complete the date and time module algorithm code, including leap year, month number of days, hours, minutes, seconds into the handover.
Josephus_problem
- 自己编写的Josephus问题的求解方法，用C语言采用数组方式实现，个人认为比教科书上提供的方法要精简的多，和大家一起分享-I have written Josephus problem solving method, using C language using an array of ways to achieve, personally think that way than the provision of textbooks to be streamlined and more to
fitting
- 对于空间上的任意几个点所在的直线或曲线，该程序可以拟合出的方程。-For any of several points on the space where the line or curve, the program can fit out of the equation.
a
- 编写具有如下函数原型的非递归两种函数f，负责判断数组a的前n个元素是否从大到小完全有序了，是则返回true，否则返回false。并编制主函数对它们进行调用，以验证其正确性。 bool f(int a[], int n) 提示： 非递归函数中只需逐对地判断各a[i]与a[i+1]是否都已从大到小有序排列（i = 0，1，…，n-2）。-Prepared with the following function prototype of two non-recursive fun
code
- 模拟一个双正交信号源通过一个高斯噪声信道后，解码出来的数据和原来的数据进行比较估算其错误概率.-Simulation of a Communication System Employing M=4 Biorthogonal Signals.The purpose is to estimate the probability of error as a function of the SNR.