登录
首页 » Visual C++ » CatchData

CatchData

于 2010-03-22 发布 文件大小:2KB
0 99
下载积分: 1 下载次数: 0

代码说明:

说明:  读取股票数据文件,C++源程序,非常好用。是学生做毕业设计的源料(Read the Stock Data File)

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

发表评论

0 个回复

  • fibonacci-heap
    斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。(Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.)
    2013-09-17 18:02:59下载
    积分:1
  • code
    c语言的一些小李子,初学c的朋友有帮助,主要有顺序表、二分查找、二叉树、单链表等等(Some Survival Song c language, c beginner to help a friend, there are sequence tables, binary search, binary tree, a single linked list, etc.)
    2011-08-11 20:50:26下载
    积分:1
  • Huffman
    哈夫曼树可以使读者快速方便的查找所需文件(Huffman tree allows readers to quickly and easily find the file)
    2010-06-09 13:09:47下载
    积分:1
  • shizuo
    用哈夫曼编码的方式进行图像的压缩,其中定义了一个cdib的类,通过之类来对图像进行处理(image coding in haffman)
    2012-04-27 18:37:47下载
    积分:1
  • sgu-499
    题意:给你n个数,求出两两组合的最大公约数 类似打素数表的做法 (Meaning of the questions: to give you the number n, find greatest common divisor of a similar combination twenty-two hit the practice table of prime numbers)
    2011-08-30 21:56:59下载
    积分:1
  • maze
    实现经典问题老鼠迷宫,并用坐标将路径显示出来(Achieve classic problem rat maze, and coordinate with the path displayed)
    2016-05-25 22:56:59下载
    积分:1
  • LongestIncreasingSequence
    找出数组A中最长的递增序列的长度,使用动态规划算法,复杂度为O(N*N)。(Find the longest increasing sequence)
    2011-09-05 17:36:27下载
    积分:1
  • Kruskal
    克鲁斯卡尔算法思想.cpp int seekedge(EDGE * (&a), int n) void bubble(EDGE * (&a), int size) void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针,a2是最小生成树边集的头指针,k为所要删的边 void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
    2009-06-27 01:43:39下载
    积分:1
  • migong
    迷宫问题,利用随机数自动生成迷宫,并自动进行探索。迷宫起点及终点由用户自己设定。(Maze problem, the use of random number automatically generated maze, and automatically explore. The starting point and end point of the maze is set by the user. 双语对照 )
    2021-04-26 16:48:45下载
    积分:1
  • Data.Structures.For.Game.Programmers
    说明:  详细介绍了游戏设计的数据结构注意事项,对与游戏中角色和游戏模式作者给予了督导的见解,书中语言为全英文但通俗易懂!很是推荐 (Data.Structures.For.Game.Programmers Detailed data structure of the game design considerations, the role with the game and game modes of supervision given to insights, the book in English but the language is easy to understand! It is recommended)
    2010-04-14 11:21:09下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 31今日下载