搜索资源列表
链表之VB实现(类)
- 链表一般是用C或C＋＋实现的，用VB的类模块实现，试过吗？没想到可以实现吧-C or C + +, VB class module, tried? Never mind can achieve it
counts
- 记数问题，本实验已经通过运行，下载后就可以用了。-mind a few problems, the experiment by running, you can download spent.
kris_qsort_exe
- This forced me to write about more interesting and comprehensive sorting methods, the result of which is this one. Through this writing I have tried to give in-depth coverage of the entire sort algorithm I hope Peter wouldn t mind reading it. This ar
Huffmatreeofdatastructure
- 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的路径长度（若根结点为0层，叶结点到根结点的路径长度为叶结点的层数）。树的带权路径长度记为WPL=(W1*L1+W2*L2+W3*L3+...+Wn*Ln)，N个权值Wi(i=1,2,...n)构成一棵有N个叶结点的二叉树，相应的叶结点的路径长度为Li(i=1,2,...n)。可以证明哈夫曼树的WPL是最小的。-Huffman tree is also called the op
yiyuan
- 一元多项式的运用，实现其相加减，利用链表，强化技能- Just two hours a day spent keeping the mind and body busy is as effective at warding off dementia as drug treatment, research reveals.
7-different-kinds-of-sort-mind
- 包含7种不同的排序算法，并能够进行比较，直观的比较出排序所需时间-Contains 7 different sort algorithms, and be able to compare the visual comparison of the time required to sort
m_files_4
- Today, there is almost no area of technical endeavor that is not impacted in some way by digital image processing.We can cover only a few of these applications in the context and space of the current discussion. However, limited as it is, the m
1341
- 有一个N*N的字符矩阵，从上到下依次记为第1行，第2行，……，第N行，从左至右依次记为第1列，第2列，……，第N列。 对于这个矩阵会进行一系列操作，但这些操作只有两类： (1) R: 将矩阵逆时针旋转90度； (2) P x y: 将此时第x行第y列的字符打印出来，其中1 <= x, y <= N。 输入数据的第一行包含一个整数T (1 <= T <= 20)，表示接下来一共有T组测试数据。 对于每组测试数据，第一行包含一个整数N (1
2013_NANJING
- 这是个人做2013年ACM-ICPC南京区域赛真题重现的部分题解，题目都比较有心意，有挑战性，值得一做。-This is a solution to a problem section 2013 ACM-ICPC Nanjing regional tournament Zhenti reproduce individuals do, there are more topics mind, challenging, and worth doing.