读写Excel文件

一个SOCKET的例子，大家一起学习，请国防大学-A SOCKET example, everyone learning together, please the National Defense University

Open Wiki,搜了很长时间，发现这个wiki还好用-Open Wiki, I searched for a long time, find this one is pretty good

11dsafsdfasdfaffffffffffffffffffffffffffffffffffffffff11dsafsdfasdfaffffffffffffffffffffffffffffffffffffffff11dsafsdfasdfaffffffffffffffffffffffffffffffffffffffff11dsafsdfasdfaffffffffffffffffffffffffffffffffffffffff11dsafsdfasdfaffffffffffffffffffffffffffffffffffffffff11dsafsdfasdfaffffffffffffffffffffffffffffffffffffffff11dsafsdfasdfaffffffffffffffffffffffffffffffffffffffff11dsafsdfasdfaffffffffffffffffffffffffffffffffffffffff11dsafsdfasdfaffffffffffffffffffffffffffffffffffffffff

以深度为k的满二叉树(n=2k-1)为例，假设表中每个记录的查找概率相等，即 pi=1/n（1≤i≤n），而树的第i层上有2i-1个结点，因此，折半查找的平均查找长度为： 所以，折半查找的平均时间复杂度为O(log2n)。 -To a depth of k over the binary tree (n = 2k-1) as an example, suppose the table to find the probability of each record the same, that is, pi = 1/n (1 ≤ i ≤ n), and the tree layer of the first i There are 2i-1 nodes, therefore, to find half the average length of search as follows: Therefore, to find half the average time complexity is O (log2n).

很好的资源管理器源码，可以方便的实现资源管理器的所有功能-Good source resource manager, you can easily realize Explorer all the features

一维欧拉方程的高精度求解，WENO/WENO重构，ROE flux-One-dimensional Euler equations for solving the high-accuracy, WENO/WENO Reconstruction, ROE flux

汇编语言的示例，学习的好东东，要下的快了。-Examples of assembly language, learning a good Dongdong, it is necessary to fast.

从收藏栏取得icon-column from collections made icon

内存当中有关网页的操作，可以将查找到的内容全部表上颜色，在不用建立文件的情况下装载网页。-Memory among the website s operation, you can find all the tables on the content of the color, do not create the document in the case of loading pages.

#define PARTIALLYSORTED_30 3 #define PARTIALLYSORTED_50 4 #define PARTIALLYSORTED_70 5 #define RANDOMIZE_QSORT 1 #define MERGE_SORT 2 #define SELECTION_SORT 3 #define BUBBLE_SORT 4 / *---随机化快速排序---* / int random_partition (int * arr、 int 开始，int 结束） ； void random_quick_sort (int * arr、 int 开始，int 结束） ； /*----------------------------------------------*/ /*-----------Merge Sort--------------------------*/ 空的分区 （int arr []，int 低，int 高） ； void 归并 (int arr []，int 低，年年高 int int) ； /*------------------------------------------------*/ / *---选择排序---* / void sort_select (int n) ； int; maxind(int m) void swap1 (int * x int * y); /*------------------------------------------------*/ /*-----------------Bubble sort--------------------*/ void recursive_bubble (int * 数组、 int 的大小） ； /*-----------------------------