我的串的连接算法实现

实数序列的快速傅立叶变换，基本算法为分裂基算法，将实数序列数组的地址给函数即可-actual sequence of the fast Fourier transform, the basic algorithm for splitting algorithm-based, real-sequence addresses to the array function can be

微分的数值计算综合了算法在导弹中的应用，很有用-Differential synthesis of the numerical calculation algorithm in a missile application, very useful

基于最小二乘原理的正交多项式拟和输入原始数据及拟和次数即可输出最终拟和表达式系数-based on the principle of least squares orthogonal polynomials and to the importation of the raw data and can be exported and the number of proposed and final expression coefficient

Lifitime tracer. *** *** *** *** *** *** *** *** ***** Example: #include void foo() { TRACE_LIFETIME usleep(100000) } void main() { foo() } *** *** *** *** *** *** *** *** *** See lifetimes.log: FUNC: void foo(), AV TTL: 00000xxxxx us (main.cpp, 000xxx) TTL: 00000xxxxx us (THREAD ID: 0000xxxx) ****************************************************** Explanation of newly created lifetimes.log: FUNC - function, whose lifetime we measured AV TTL - mean (average) spent time of all functions calls TTL - time spent on each function call THREAD ID - thread that called a function. ***************************************************** Description: - was written for QT project - multithreaded support (Loki::Singleton has multithreaded sync support) **************************************************** Dependencies: - QT - Loki (A. Alexandrescu) -Lifitime tracer. ****************************************************

这是Badming写的一些关于AI的c++代码，他认为现代的脚本语言实际上是未来Ai的前身。当代码复杂到一定程度，程序给人类的反应，人类已经分不清是不是死的代码或是真的有意识产生了。-This is a Badming written about AI in c++ code, he thinks of modern scripting language is actually the predecessor of the future of Ai. When the code is complex and to a certain extent, the program" s response to mankind, mankind has not distinguish the code is not dead, or really awareness created.

汉密尔顿回路的C语言实现代码，是国外的人写的，和好很强大-code for Hamilton circuit C language implementation

这是研究生的并行计算的作业，实现多插入排序抽取算法，C语言的。-it is a homework for postgraduate by C language ，in order to sort data。

一维有限元方法

应用背景本代码用于国际机器人比赛，识别图标有左拐、右拐、直走三个方向，识别率可以达到90%，在机器人倾斜角度相对较小的情况下，识别率可以达到100%。每秒钟可以识别40~60张图片。有效的提升了机器人竞技实力！关键技术本代码采用图像细化骨架提取和霍夫变换拟合直线，通过图像细化提取路标的骨架，再通过霍夫变换拟合直线，再通过拟合的直线，计算拟合后直线的方向，以45度为标准，倾角大于45度的视为纵线，否则视为横线，在通过判定的直线方向给拟合后直线归类，竖直和水平方向，根据直线中心点的位置，判断当先路标的指向。

矢量的快速排序-Quick sort of vector