资源列表
shellsort111
- 附有本人超级详细解释（看不懂的面壁十天！） 一、 实际问题: 希尔排序(Shell Sort)是插入排序的一种。因D．L．Shell于1959年提出而得名。它又称“缩小增量分类法”，在时间效率上比插入、比较、冒泡等排序算法有了较大改进。能对无序序列按一定规律进行排序。 二、数学模型: 先取一个小于n的整数d1作为第一个增量，把文件的全部记录分成d1个组。所有距离为dl的倍数的记录放在同一个组中。先在各组内进行直接插人排序；然后，取第二个增量d2<d1重复上述的分组和
05062129
- 蚀膨胀细化算法源代码 用C++BUILDE写的-corrosion expansion thinning algorithm using source code written in C BUILDE
zhipaiwenti
- 运筹学之指派问题的匈牙利算法。刚刚才看到的，不错哦-tacticians Zhi assignment of the Hungarian algorithm. Only just to see, oh well
2SAT
- 对于给定的2-CNF，设计一个线性时间算法，判定其是否可满足。-given for the 2-CNF, design a linear-time algorithm that can determine whether they meet.
ncircle
- 给定n个大小不等的圆c , c , , cn 1 2 ，现要将这n个圆排进一个矩形框中，且要求各圆 与矩形框的底边相切。圆排列问题要求从n个圆的所有排列中找出有最小长度的圆排列。例 如，当n=3，且所给的3 个圆的半径分别为1，1，2时，这3个圆的最小长度的圆排列如图 所示。其最小长度为2 + 4 2 。-given n ranging from the size of the circle c, c,, cn 1 2
B64
- b64.java b64编码 这还不够长 这还不够长 这还不够长 -b64.java B64 coding that is not enough - this not enough - it has not been long enough that it has not been long enough not long enough that it has not been long enough it has not been long enough that it has not
sparsehash-0.2
- google的hash table库实现，非常高效-the hash table for achieving very high efficiency
QueueFromStack
- Microsoft 面试常考算法 Implementation of Queue using 2 Stacks.-interviews often test algorithm Implementation of Queue using two protocol stacks.
TravelGuideApp
- 最短路径和哈密顿通路，可以求得多条最短路径和哈密顿通路。-shortest path Hamiltonian path and can be obtained over the shortest path and Hamiltonian path.
MD511
- md5代码加密算法的源代码 md5代码加密算法的源代码-md5 code encryption algorithm source code encryption algorithm md5 the md5 source code encryption algorithm source code
host2
- 马踏棋盘算法编程，实现在棋盘上任意两点间的最短路径求解。-horse riding chessboard programming algorithm to achieve on the chessboard arbitrary 2:00 of finding the shortest path.
weekday
- 给年、月、日该程序转换成星期。该程序本人多次严正是对的。-to the year, month and day of the proceedings into weeks. I repeated the procedure on the stern.