search

大学计算机专业教材《数据结构》中栈的实验、练习源码(University computer professional teaching materials" data structure" stack experiment, practice source code)

说明：  任意给定输入的一个小写英文字符串a1a2a3…an-1an (n≥5) 输出：字符串Ana1An-1a2An-2a3…A2an-1A1an,其中Ai为ai的大写形式 例如，输入aybdx，则递归程序输出XaDyBbYdAx (Any given input of a lowercase string a1a2a3 ... an-1an (n ≥ 5) Output: the string Ana1An-1a2An-2a3 A2an-1A1an, which Ai ai uppercase for example, input aybdx recursive program output XaDyBbYdAx)

二叉树的设计。包含二叉树结点类的设计以及二叉树的遍历。(Binary tree design. Contains the binary tree node class design, and Binary Tree Traversal.)

本程序实现一元多项式合并。本程序输入方式为按项输入，每输入一个项，会先提示输入项的幂，再提示输入项的系数。(This procedure combined to achieve a dollar polynomial. This procedure according to entry input methods for the input, one for each input item, it will first prompt entry of the power, and then prompts entry of the coefficient.)

这是数据结构很重要的程序，主要是课后题的答案，和代码，功能很强大(the data struct of the book)

清（英文）常见数据结构，代码实现，值得下载，值得分享(Qing (English) common data structure, code implementation, worth downloading, worth sharing)

说明：  一个实现外部排序的程序，其中gnerate.cpp为产生一个随机的文件，用于被排序。而caculate.cpp为外部排序程序。(A realization of the external sort program, which gnerate.cpp to generate a random file for be sorted. The caculate.cpp external sort program.)

蜂群算法C语言实现，附带中文注释，简单易懂(ABC algorithm coded using C programming language)

各种排序的模板实现，并分析了各种实现的时间复杂度及改进办法(Templates of various sort, and analyze the time complexity of the various implementations and ways to improve)

数字根算法，用最简单的代码计算数字根。如果把一个大数的各位数字相加得到一个和，再把这个和的各位数字相加又得一个和，再继续作数字和，直到最后的数字和是个位数为止，这最后的数称为最初那个数的“数字根”。(Digital root algorithm, with the most simple code to calculate the digital root. If you figure in a large numbers is the sum of a, then this and you figure the sum is again a, and then continue for digital and until the final figure and the single digits, the last number called initially that the number of "digital root".)