登录
首页 » Visual C++ » dxsjjc

dxsjjc

于 2009-12-29 发布 文件大小:1KB
0 165
下载积分: 1 下载次数: 43

代码说明:

  多项式加减乘 用数据节够得算法实现多项式的加减乘 原理简单易懂(suoxiangshi jiajiancheng)

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

发表评论


0 个回复

  • Czhihen
    关于C语言的一些指针的处理算法,能够使得初学者对C语言指针有自己的了解(Some pointers on C language processing algorithms, it is possible to make a beginner C language pointer has its own understanding)
    2016-06-17 11:29:59下载
    积分:1
  • dxsjjc
    多项式加减乘 用数据节够得算法实现多项式的加减乘 原理简单易懂(suoxiangshi jiajiancheng)
    2009-12-29 11:13:13下载
    积分:1
  • Figure-topological-sort
    说明:  拓扑排序   对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任 意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。   通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。 注意:   ①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。   ②若图中存在有向环,则不可能使顶点满足拓扑次序。   ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )
    2011-03-22 17:19:14下载
    积分:1
  • xiaobaishu
    参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写,很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)
    2013-08-29 16:09:43下载
    积分:1
  • npxkcsj
    数据结构课程设计,多种内部排序的效率分析(Data structure course design, the efficiency of a variety of internal sorting)
    2010-07-07 07:34:56下载
    积分:1
  • shizuo
    用哈夫曼编码的方式进行图像的压缩,其中定义了一个cdib的类,通过之类来对图像进行处理(image coding in haffman)
    2012-04-27 18:37:47下载
    积分:1
  • ddt
    多段图、遍历、排序。用C语言解决多段图中的成本问题,得出最佳优化方案。(More paragraphs figure, traverse, ranking. C language solve more paragraphs in the chart the cost, obtains the best optimization scheme. )
    2012-05-12 13:49:10下载
    积分:1
  • text
    输入N个点的坐标,判断这N个点能否构成一个凸多边形。(Enter the coordinates of N points, to determine whether the N points form a convex polygon.)
    2011-12-13 09:43:42下载
    积分:1
  • xuanzexingjiegou
    选择型结构c语言编程 (Choose the type of structure of C language programming)
    2013-09-24 22:11:37下载
    积分:1
  • data-struct
    对于数据结构每一章节的相应的练习题,巩固好数据结构(To consolidate data structure corresponding practice questions for each chapter of the data structure)
    2012-10-09 17:03:41下载
    积分:1
  • 696518资源总数
  • 105417会员总数
  • 32今日下载