It is written in C# using a de

一个很简单的windows程序，但特别有意思，使用到了很多的游戏编程知识！-a very simple procedure windows, but particularly interesting, the use of a lot of games programming knowledge!

单链表的插入和删除实验目的： 1、定义单链表的结点类型 2、通过单链表的定义掌握线性表的链式存储结构的特点； 3、熟悉单链表的建立以及插入、删除等基本操作。 -# include # include # define ND sizeof(struct List) struct List {int data struct List*next } void main() { int n,i=1,e,a struct List*head struct List*p,*q q=head=p=(struct List*)malloc(ND)

ISOIEC-15444-12-2004 标准-ISOIEC- 15444-12-2004 standard

OPNET Simulation Model:IEEE 802.15.4 -OPNET Simulation Model: IEEE 802.15.4

LABEL的URL连接，LABEL的URL连接-LABEL URL link, the URL link LABEL

用DFS算法遍历图-with DFS traversal algorithm map

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.

此乃一小狗找茬的游戏，用j2me做的，大家可以免费下载哦-This is one finding fault puppy game, using j2me to do, and everyone can be downloaded for free Oh

Quick sort program , It is program for Quick sort algorithm implelementation in C

用asp来实现 附件功能计算，很好用，没有错误！ 但还请各位专家给与指正！ 谢谢！-used to achieve attachments, useful, no mistake! But also asked the experts to give correct! Thank you!