二分搜索，不只只是查找（运用单调性）

这是我们在数字通信方面的任务。仿真结果表明，该方法没有误差。希望有帮助！

目的是把左边的所有盘子移到右边的杆子上。一次只能移动一个盘子，你可以使用中间的杆子作为临时存放盘子的地方。小盘子必须放在大盘子之上。问题看似不难。的确，如果盘子只有两三个，是很容易解决的。但是随着盘子数目的增加，问题就变得非常难解了。 -purpose is to the left of all the dishes moved to the right side of the pole. Only a mobile one tray, you can use the middle of the pole plate as a temporary storage place. Small plates must be placed on the platter on top. It may seem it is not difficult. Indeed, if the plate is only 23, it"s very easy to solve. But with the increase in the number of dishes, the problem has become a very difficult.

矩阵的广义逆计算，共两种方法，其中迭代法有一阶收敛和二阶收敛-generalized inverse matrix calculation, a total of the two methods, which iteration is a second-order convergence and convergence

插值、拟合与规划问题 插值、拟合与规划问题-Interpolation, fitting with the planning of interpolation, fitting and planning issues

nsga2算法优化ZDT2测试函数。收敛到Pareto最优前沿，对于从事这方面算法工作的初学者们有很大的帮助。可以借鉴学习下

椭圆曲线离散对数问题C源代码-elliptic curve discrete logarithm problem C source code

大数运算,生成两个随机大数,然后计算他们的和,差等-Computation of large numbers to generate two random large numbers, and then calculate them and, poor

STM32F1摄像头定位算法（融合测试） 定位算法

这是凸优化中梯度法的代码

矩阵乘法