tcpip

用VC++编写中值滤波的算法，具有图形界面(The algorithm of Filter ，which use VC++)

有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)

单向链表的创建与操作 设单向链表中节点的数据域的数据类型为整型，编写函数实现以下操作： （1）实现单向链表的创建（包括初始化）与输出操作，节点的个数及节点的数据由用户输入。 （源代码：ds3-1.c） （2）查找给定的单链表中的第i个节点，并将其地址返回。若不存在第i个节点，则返回空地址。 （源代码：ds3-2.c） （3）查找给定的单链表中值为n的节点，并将其地址返回。若不存在值为n的节点，则返回空地址。同时，还应通过参数传回该节点的序号。 （源代码：ds3-3.c） （4）删除给定的单链表中的第i个节点，成功返回1，失败返回0。 （源代码：ds3-4.c） （5）删除给定的单链表中值为n的节点，成功返回1，失败返回0。 （源代码：ds3-5.c） （6）在给定的单链表的第i位上插入值为n的节点。 （源代码：ds3-6.c） （7）在给定单链表的值为m的节点的前面插入一个值为n的节点。 （源代码：ds3-7.c） (Creation and operation of a one-way linked list Set up a one-way linked list data type node integer data fields , write a function to achieve the following: ( 1 ) achieve the creation of a one-way linked list ( including initialization ) and output operation , the number of nodes and node data entered by the user . ( Source : ds3-1.c) ( 2 ) Find a single list given in the i-th node and returns its address . Without the presence of the i-th node , returns an empty address. ( Source : ds3-2.c) ( 3 ) Find a given node in a given value of n single list , and return address . Without the presence of the value of n nodes , returns an empty address. Meanwhile, the number should be returned by the parameters of the node . ( Source : ds3-3.c) ( 4 ) Delete the given singly linked list in the i-th node , the successful return 1, else return 0 . ( Source : ds3-4.c) ( 5 ) to delete a single node in the list is given n , the successful return 1, else return 0 . ( Source : ds3-5.c) ( 6 ) )

链表的建立及相关处理，包括排序，删除，初始化，增加，删除等等，且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through )

最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)

校园导游，可以选择景点序号来了解景点，通过选择两点可计算最短距离和最近路线。(Campus tour guide, you can choose the attractions serial number to understand the attractions of by selecting the shortest distance can be calculated and the recently routes.)

这个是C++编译的单链表，其中包括多种链表操作，是很好的学习资料。(This is a C++ compiler single linked list, which includes a variety of linked list operations, is a good learning materials.)

利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)

自己编写的几种经典的排序算法，里面有自己做的PPT详细讲解，希望有帮助吧(I have written several classic sorting algorithm, which own PPT explain in detail, I hope to help!)

数据结构快速排序例程代码，只要按照例子就可以很容易加入到你的程序当中。(Data Structures quick sort routine code, just follow the example you can easily add them into your program.)