数据结构

C How to Program 第12章课后练习题12，13题，可以计算多位整数，+，-，×，/，%以及求幂运算

本程序实现了败者树等外排序方式，封装性好，代码强壮-program of the master tree outer Sort, Packaging and good strong code

离散01串问题，(n,k)01 串定义为：长度为n 的01 串，其中不含k 个连续的相同子串。对于给定的正整数n 和k，计算(n,k)01 串的个数。-discrete series of 01 questions, and (n, k) 01 Series : the definition of the length of n strings of 01, which is non-consecutive k-the same string. For a given positive integer n and k, calculated (n, k) 01 series of numbers.

数据算法，凉东问题-data algorithm, the cooler East problem

顺滑转弯，可以极大程度上减少电脑鼠在迷宫转弯时的损耗时间。本设计讨论电脑鼠底层驱动算法中有关电脑鼠 转弯部分(90度转弯)的改进算法，该方法改进了以往在电脑鼠转弯过程中首先对左右两个电机同时制动， 然后一个电机正向转动，一个反向转动，从而形成电脑鼠转弯过程的传统方法。 本设计所用的方法是在转弯过程中电机不停转，在转弯过程中让一个电机处于减速状态， 另一个处于加速状态(但不停机)，然后调整步进电机的步数，使两个电机同时前向转动， 接着调整步进电机在转弯时的步数，待转弯结束后再使电机处于加速状态，并进入前进状态

这是我个人做的在vc环境下的迷宫问题的实现。各位可以参考或指教！-This is my personal vc done in the context of the realization of the maze. You can reference or enlighten!

这里有一些数据结构中的通用算法，拿出来和大家共享了◎-Here are some of the generic data structure algorithms, up to and everyone shared ◎

This code supplements the tutorial in Finite State Machines

fsdfsadfsdfsdfsdgdgdgfg dsfg sdfg dsf gsdfg sdfgsdfg gddflskgksd gdfsjklgjklsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig ；goipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfg sdfop gisdfpogg ；fsadfsdfsddfgdgfg dfgfgfg sdfg dsdfg gsdfg gsdfg sdfgsdfg gdfgsdfg gdgfgsdfg gdfsjkldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posggoipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfg sdfop gisdfpog fsdfsadfsdgfg dfgdgfg dsfg sdfg dsf gsdfg sdfgsdfg sdfgsdfg gfd g gjdflskgksd gdfsjklgsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig goipf gdfog opsdf gspdo sdfpo gisdf gpsdfog ipsdfpog；fsdfsadfsdfsdfsdgdgdgfg dsfg sdfg dsf gsdfg sdfgsdfg gddflskgksd gdfsjklgjklsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig ；goipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfop gisdfpog ；

具有n 个顶点的无向网络G的每个生成树刚好具有n-1条边，采用三种不同的贪婪策略来选择这n-1条边。-n vertices to the non-G network spanning tree just with each n-1 edge, using three different strategies to choose greed that n-1 edge.