数据结构课程设计链表

这是关于支持向量机SVM方面的代码,大家可以用一下-on support vector machines SVM area code, we can use this

根据日期算星期，调试通过-count on the date weeks, through debugging

本代码是通过matlab算法实现的人脸定位和人眼定位，通过肤色找到人脸，继而定位人眼。根据人眼的定位可实现之后的工作

多项式的计算-polynomial calculations. .

This code gets a text file which is output of simple scalar profiling command and process it, it extracts sequences of logical operations like and, or, shift.

实现了一个链表的逆转,全部过程在一个链表内完成!-achieve a reversal of a linked list, in the entire process completed within a List!

在VC++下实现对图象进行CANNY边缘检测,并用形态学方法进行处理,然后对它进行链码编码,最后基于链码进行方向的检测!已通过调试，直接运行即可。

约瑟夫问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，没人持有一个密码。一开始人选一个正整数作为报数上限值m，从第一个人开始按顺时针自1开始报数，报到m是停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。-a description of the problem is : No. 1, 2, ..., n n clockwise direction by individuals sitting around a circle, no one holding a password. One person started as a positive integer limits on the number of reported m, from the first individuals to embark on the clockwise from a few reportedly started, the report m is reportedly stopped a few. M reported out of the list of his password as a new value m, from a clockwise direction in the next re-started from a newspaper a few, like that, until the total of all listed so far.

通过算法计算PI值，不限位数-through algorithm PI values, the median Open-

实现阶乘算法,1000以内的数字都可以实现-factorial algorithm to achieve, within the 1000 figure can be achieved ..................................