登录
首页 » Visual C++ » abc

abc

于 2013-12-03 发布 文件大小:2KB
0 152
下载积分: 1 下载次数: 1

代码说明:

  数据结构的稀疏矩阵的几部分操作,广工的课程设计(Sparse matrix operations)

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

发表评论


0 个回复

  • suanfa
    自己编写的floyd 最短距离求解程序。实用简单。gcc (Floyd shortest distance to write your own solver. Practical and simple. gcc)
    2012-09-02 14:59:02下载
    积分:1
  • mifeng
    c语言平时作业练习,包括输入输出,数组,链表等 c语言平时作业练习,包括输入输出,数组,链表等(output mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifeng)
    2014-04-28 16:01:53下载
    积分:1
  • nuaa1108
    说明:  nuaa1108 多少连续的1 解题报告(Problem solving report )
    2009-08-23 10:01:05下载
    积分:1
  • findpt
    VC游戏编写中的求解最短路径算法源码,本示例是自动寻径演示,篮点是起点,红点是终点,按确定键开始。源码爱好者注:编译后运行的时候请把EXE文件从Debug目录中拷贝到项目根目录中,若不然会出错。 (The preparation of the VC games to solve the shortest path algorithm source code, in this example is the automatic routing demonstration, the basket is the starting point, the red dot is the end point, press the OK button to start. Source enthusiasts Note: When compiled and run, please copy the EXE file from the Debug directory to the root directory of the project, and if not be wrong.)
    2013-05-17 15:38:23下载
    积分:1
  • deep-copy
    该代码实现了深拷贝的问题,对于深拷贝进行了一系列的介绍,并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)
    2014-01-03 10:46:48下载
    积分:1
  • heapsort
    说明:  从最后一个非叶子结点开始从后往前进行调整,保证了根下的所有子树都是最大堆,最后对根进行调整,使整棵二叉树为最大堆,保证了根结点为整棵数的最大值点,完成了建堆的过程,再将根结点跟最后一个结点进行交换,如此反复操作,则堆排序就完成了,其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)
    2008-11-11 22:53:42下载
    积分:1
  • PROGRAM
    本书是《程序员面试宝典》的第三版,在保留第二版的数据结构、面向对象、程序设计等主干的基础上,使用各大IT公司及相关企业最新面试题替换和补充原内容,以反映自第一版以来近几年时间所发生的变化。   欧立奇、刘洋、段韬编著的《程序员面试宝典》取材于各大公司面试真题(笔试、口试、电话面试、英语面试,以及逻辑测试和智商测试),详细分析了应聘程序员(含网络、测试等)职位的常见考点。本书不仅对传统的C系语言考点做了详尽解说,还根据外企出题最新特点,新增加了对友元、Static、图形/音频、树、栈、ERP等问题的深入讲解。最后本书着力讲述了如何进行英语面试和电话面试,并对求职中签约、毁约的注意事项及群体面试进行了解析。本书的面试题除了有详细解析和答案外,对相关知识点还有扩展说明。真正做到了由点成线,举一反三,对读者从求职就业到提升计算机专业知识都有显著帮助。   《程序员面试宝典》适合计算机相关专业应届毕业生阅读,也适合作为正在应聘软件行业的相关就业人员和计算机爱好者的参考书。(This book is the" canon" in the third edition, retained in the second version of the data structure, object-oriented program design, main basis, the use of each big IT companies and related enterprises to the latest interview questions substitution and supplement the original content, in order to reflect the since its first edition in recent years since time changes. Ou Liqi, Liu Yang, Duan Tao," canon" drawn from major companies interview questions ( written examination, interview, telephone interview, interview, and logical test and IQ test ), a detailed analysis of the application programmer (including network, testing ) positions of the common points. This book not only to the traditional C language test done a detailed explanation, according to the new characteristics of the new foreign title, added to the friend, Static, graphics/audio, tree, stack, ERP issues in depth explanation. The last book on described how the English interview and telephone interview, and the job of signin)
    2012-03-21 11:28:19下载
    积分:1
  • JOSEPHUS
    一个关于约瑟夫环问题的经典算法编程的C语言实现(the program about JOSEPHUS)
    2011-08-13 10:09:20下载
    积分:1
  • tu
    说明:  、实验目的 1 熟练掌握各种内排序方法,深刻理解排序算法及其执行过程; 2 学会分析各种内排序算法的性能; 3 了解各种排序方法的优缺点,对于实际问题能够选择一种较好的排序方案; 4 熟练掌握图的存储结构; 5 掌握图的邻接矩阵和邻接表表示分别进行深度和广度优先搜索遍历的算法。 6 了解图的最小生成树算法。 (Proficiency in the order of search, binary search and index search basic search algorithm, these algorithms are familiar with what kind of storage structure suitable for implementation two master binary sort tree characteristics, building methods, and dynamic search algorithm 3 master hash table of characteristics and construction methods.)
    2009-12-30 21:15:29下载
    积分:1
  • BinaryTreeViaMFC
    画图法实验数据结构中二叉树先序、中序、后序遍历和显示。(Paint Method in the first order binary tree data structure, in order, post order traversal and display.)
    2011-05-27 20:14:36下载
    积分:1
  • 696518资源总数
  • 105289会员总数
  • 8今日下载