使用Javascr ipt和Applet实现网页版的插入算法、归并算法、堆排序、快速排序、多项式加减（用链实现）、十进制转化为二进制（用队+栈实现）、开放地址法（线性探测）、一次探测法（平方探测）、二次探测法（双HASH）实现快速查找、利用二叉排序树进行排序与查找以及删除一个节点、实现宽度优先或深度优先排序算法、实现Kruskal算法或Prime算法-Insertion algorithm, merging algorithm, heap sort, quick sort, polynomial addition and subtraction (with the chain to achieve), decimal converted to binary (+ stack implementation with the team), open the address method (linear probing), a detection method (square detection ), Secondary detection method (two-HASH) quick search, use binary sort tree to sort and find and delete a node, to achieve breadth or depth-first sorting algorithm, algorithm or Prime Kruskal algorithm to achieve.