登录
首页 » Visual C++ » qiuhe

qiuhe

于 2011-09-15 发布 文件大小:46KB
0 90
下载积分: 1 下载次数: 3

代码说明:

  多项式求和,用链表实现的一元多项式求和程序,比较 靠谱(Polynomial sum, with the linked list implementation of a polynomial summation procedure, more reliable)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • bubblesort
    这个是关于数据结构中冒泡排序算法的实现,大家可以利用这个为基础,进一步研究和利用排序(This is a data structure on the Bubble Sort algorithm, we can use this as a basis for further study and use of sorting)
    2009-01-14 23:37:37下载
    积分:1
  • labyrinth
    迷宫问题c源代码,大小为8*8的迷宫。主函数中输入开始位置和结束位置的坐标,输出所有可能的路径(Maze c source code, size 8* 8 of the maze. Enter the start the main function of the coordinates of the position and end position, the output of all possible paths)
    2010-12-19 23:31:36下载
    积分:1
  • 最短路径c++语言
    说明:  用从c++写的floyd最短路径算法,可以求邻接矩阵任意两点的最短路径。(from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.)
    2020-09-20 14:07:55下载
    积分:1
  • bag1
    使用不同的方法解决背包问题:本算法采用的是动态规划方法,比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)
    2011-07-16 18:40:31下载
    积分:1
  • american_heritage
    USACO中的American heritage,用C++编写,运用了树的遍历知识(the American heritage of USACO, with C++ prepared, using a tree traversal knowledge)
    2013-07-21 18:31:10下载
    积分:1
  • Huffman
    说明:  数据结构:Huffman编码。哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛,如JPEG中就应用了哈夫曼编码。 哈夫曼树又称最优二叉树,是一种带权路径长度最短的二叉树。(Data structure: Huffman coding. Huffman coding is an application of the Huffman tree. Huffman coding is widely used, such as JPEG in the application of the Huffman coding. Huffman tree, also known as the best binary tree is a weighted shortest path length binary tree.)
    2011-03-29 22:44:59下载
    积分:1
  • PolynomialCoeff
    NTL应用——大数系数多项式乘法的计算。从文件读如参数,计算多项式相乘后某项的系数(NTL application- the multiplication of big numbers coefficient polynomial )
    2021-04-11 09:58:58下载
    积分:1
  • C1
    说明:  由C程序实现的 数学上 滑雪问题 的代码实现,供大家学习用(Ski problem code for all to learn to use)
    2011-05-28 14:51:40下载
    积分:1
  • d
    有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)
    2013-11-29 14:32:18下载
    积分:1
  • astar
    A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0) 2、重复以下步骤: 在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点 把当前节点从开放列表删除, 加入到封闭列表. (A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values ​ ​ are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)
    2013-04-04 11:06:42下载
    积分:1
  • 696518资源总数
  • 104225会员总数
  • 32今日下载