登录
首页 » Visual C++ » sort-algorithm-validation

sort-algorithm-validation

于 2013-04-22 发布 文件大小:28KB
0 104
下载积分: 1 下载次数: 1

代码说明:

  直接插入排序算法验证。 快速排序算法验证。 直接选择排序算法验证。 (Direct insertion sort algorithm validation. Quick sort algorithm validation. Direct selection sort algorithm validation.)

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

发表评论

0 个回复

  • 1
    可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)
    2013-11-13 21:16:53下载
    积分:1
  • BinaryTree
    数据结构使用三叉链表表示的二叉树的基本操作(Data structures using the binary tree expressed in the trigeminal lists the basic operation of)
    2010-06-26 10:51:43下载
    积分:1
  • Sort
    排序,各种排序算法,插入排序,冒泡排序,快速排序,等等!(Sorting, various sorting algorithms, insertion sort, bubble sort, quick sort, and more!)
    2011-05-08 00:09:13下载
    积分:1
  • tt0202
    1.建立两个有序得链表(带表头,用头插法); //2.写一算法在单链表上实现线性表的ListLength(L)运算。 写一算法将单链表中值重复的结点删除,使所得的结果表中各结点值均不相同。 (1. The establishment of two ordered lists too (with header, with the first interpolation) // 2. To write a method to achieve a single linked linear form of ListLength (L) operations. Write an algorithm to list the value of a single node to delete the duplicate, so the results in the table are not the same as the value of each node.)
    2010-09-10 10:26:46下载
    积分:1
  • HuffanCoding
    读取数据,统计所得到的文件中每个字母的权值,创建哈夫曼树,哈夫曼编码。哈夫曼解码,解码后内容写入到指定的文件。 读取数据里面的内容是由英文单词组成。读取文件的时候传入文件存放的路径、读取方式以及读出以后存放的数组,最终可以得到一个存放目标文件内容的数组。 将得到的数组进行字母权值的统计,统计每个字母出现的次数,次数即为每个字母的权值。 将得到的字符数组与权值数组作为创建哈夫曼树的依据,哈夫曼树根据每个字母权值的大小来创建,每个节点,包括权值、父节点、左子、右子和字母本身。 根据哈夫曼树进行编码。形成目标文件的哈夫曼编码,将此编码返回。 根据哈夫曼树得到的数组即为解码数组,解码数组作为解码的结果返回。 写入输出文件,将解码得到的数组、文件的完整路径以及文件的写方式作为参数传入,将数组写入到相应的文件中。 (Read the data, statistical documents obtained weights for each letter, create a Huffman tree, Huffman coding. Huffman decoding, the decoded contents are written to the specified file. Read the content inside is composed of English words. When the incoming file to read the file storage path, read mode and read out after storage array that can eventually get a storage target file contents of the array. The resulting array of letter weights statistics, statistical number of occurrences of each letter, the number is the weight of each letter. The resulting character array with the weights array as the basis for creating Huffman tree, Huffman tree based on the size of the weights of each letter to create, for each node, including weights, parent, left child, right child, and letter itself. According to Huffman coding. The formation of the target file Huffman coding, this code returns. According to Huffman decoding the resulting array is an array, the decoder decodes the result is retur)
    2020-07-02 15:40:01下载
    积分:1
  • InverseList
    说明:  链表逆转,实现单链表的逆转程序,数据结构(List Inverse)
    2011-04-04 11:15:58下载
    积分:1
  • single
    单链表逆置的源码~提供了源码和源码说明~简单实用,适用于课堂作业程度(Reverse single linked list provides a set of source code source code and source code ~ ~ simple and practical instructions for classroom work degree)
    2011-02-15 13:58:07下载
    积分:1
  • suanfa
    自己编写的floyd 最短距离求解程序。实用简单。gcc (Floyd shortest distance to write your own solver. Practical and simple. gcc)
    2012-09-02 14:59:02下载
    积分:1
  • shizuo
    用哈夫曼编码的方式进行图像的压缩,其中定义了一个cdib的类,通过之类来对图像进行处理(image coding in haffman)
    2012-04-27 18:37:47下载
    积分:1
  • bstree_frame
    利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)
    2013-08-10 16:43:50下载
    积分:1
  • 696518资源总数
  • 104360会员总数
  • 40今日下载