leetcode 1 two sum problem

这是一个用ＶＣ实现在数据结构课程中比较经典的应用的一项式运算的程序．这个也测试通过．应该没有任何问题．-with VC data structure courses in the more classic use of a Type Operational procedures. This is also the test. Should be no problem.

A Star 和 dijkstra

求解n维具有不等式约束优化问题的最优解-solving n-dimensional inequality constrained optimization with the optimal solution

南开大学2008年暑期ACM集训，初期共享代码-ACM Nankai University in 2008 summer training camp, the early sharing of code

这是在 labview 的 spwm 3 阶段。 学生只有一个示例去想怎么能做一种三相逆变器使用 labview 和 DAQ。

用C语言编写一个能计算当前日期是本年第几天的程序（可区分闰年问题哦）-C language one can calculate the date of the current year is the first few days of proceedings (which can distinguish between a leap year problem oh)

一个用C语言编写的通用的隐性马尔可夫代码库-a general c code for hidden semi-Markov model

这是一个算法来解决问题的野蛮人和传道人，这是用Cpp 语言写的。

数值积分:关键词：数值积分 近似 插值求积 梯形 辛普生 复化 逐次分半 龙贝格-numerical integration : Key words : numerical integration approximate interpolation Quadrature trapezoidal Simpson Health Minute of successive half Romberg

CPU是计算机系统中一个十分重要的资源，本章主要介绍处理机的调度目标、策略以及评价方法等。因为处理机调度程序不可能选择全部驻留在外存的进程，因此，在调度一个进程占有处理机之前，系统必须按某种策略把外存中处于后备状态的作业选择出来，并创建进程和分配内存，为进程执行准备必需的资源。这一步称为作业调度或高级调度。作业调度的目标是尽量做到公平合理，能执行尽可能多的作业、尽快地响应时间以及高的设备利用率等。任一调度算法要同时满足这些调度目标是不可能的。大多数操作系统都是根据用户需要而采用兼顾某些目标的方法。比较常用的作业调度算法有：FCFS（先来先服务）、方法、SJP(最短作业优先)法、HRN(最高响应比)法等。这-CPU computer systems is a very important resource, this chapter introduces processor scheduling objectives, strategies and evaluation methods. Because the processor scheduling procedures could not choose Disk presence in all the process, and therefore, in the process of scheduling a possession before the processor, the system must be some kind of strategy to Disk backup were at the operational state of choice out and the process of creation and distribution of memory, the process of preparing the implementation of the necessary resources. This step as job scheduling or senior scheduling. Job Scheduling goal is to try to make it fair and reasonable to carry out the operation as much as