登录
首页 » Visual C++ » FRFT-algorim

FRFT-algorim

于 2020-07-04 发布 文件大小:1239KB
0 237
下载积分: 1 下载次数: 33

代码说明:

  常在该网站下载资料,也想分享些材料上去,这个资料是FRFT算法(Often the site to download information, but also want to share some material up, this information is FRFT algorithm)

文件列表:

FRFT——algorim
...............\Debug
...............\.....\Fourier.obj,7490,2009-11-10
...............\.....\Fourier.sbr,0,2009-11-03
...............\.....\FRFT.bsc,82944,2009-11-03
...............\.....\FRFT.exe,221261,2009-11-17
...............\.....\FRFT.ilk,240140,2009-11-17
...............\.....\FRFT.obj,30820,2009-11-17
...............\.....\FRFT.pch,3634224,2009-11-10
...............\.....\FRFT.pdb,525312,2009-11-17
...............\.....\FRFT.sbr,0,2009-11-03
...............\.....\vc60.idb,156672,2009-12-24
...............\.....\vc60.pdb,77824,2009-11-17
...............\Fourier.cpp,3545,2009-11-04
...............\Fourier.h,740,2009-11-10
...............\FRFT.CPP,14046,2009-11-17
...............\FRFT.DSP,3531,2009-11-02
...............\FRFT.DSW,533,2009-11-02
...............\FRFT.ncb,74752,2011-11-30
...............\FRFT.OPT,48640,2011-11-30
...............\FRFT.PLG,242,2009-12-24
...............\output.txt,2098,2009-12-24
...............\signal.txt,2097,2009-11-17
...............\~VC211.tmp,54784,2009-12-24
...............\~VC212.tmp,50688,2009-12-02

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

发表评论

0 个回复

  • BiTree
    二叉排序树的建立、插入与删除。按递增顺序插入N个整数,并按同样顺序删除;(Binary sort tree establishment, insertions and deletions. Insert N integers in ascending order, press the same sequence deleted )
    2020-09-05 16:38:05下载
    积分:1
  • Graph
    数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)
    2013-11-28 10:53:29下载
    积分:1
  • code
    各种数据结构代码,欢迎下载,里面有JAVA,C,C++等等各种版本(Data structure and code, please download)
    2010-06-22 11:11:45下载
    积分:1
  • fast_sort
    /*快速排序:以待排序元素中的第一个元素作为基准将带排序的元素分为三组 *大于基准元素为一组置于基准值的右边,小于基准值的元素为一组置于基准值的左边, *基准值为一组,这样就找到了基准元素的位置就确定了 *如此递归调用。直到每一组的low==high,即实现了排序的要求。 */ (/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
    2012-10-26 21:42:43下载
    积分:1
  • we
    说明:   简单的链表实现 链表可以初步了解(A simple list can be linked to achieve a preliminary understanding)
    2008-12-10 17:08:15下载
    积分:1
  • Hash-table
    本代码主要实现了哈希表的设计,完成了哈希函数的相关要求。(The code is designed to achieve a hash table, the completion of the relevant requirements of the hash function.)
    2013-12-30 17:15:14下载
    积分:1
  • CR17_2014.05.19_list
    数据结构线性表教学笔记,内容讲基础知识,没基础可以看看(Linear table data structure teaching notes, basic knowledge content says, no base can take a look)
    2014-06-09 23:35:37下载
    积分:1
  • zuiyouerfenjiansuozhu
    最优二叉搜索树问题具有最优子结构性质,即其任意一棵子树都是一棵独立的最优二叉搜索树,所以可以采用动态规划方法,并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)
    2013-10-10 18:48:17下载
    积分:1
  • FRFT-algorim
    常在该网站下载资料,也想分享些材料上去,这个资料是FRFT算法(Often the site to download information, but also want to share some material up, this information is FRFT algorithm)
    2020-07-04 13:00:02下载
    积分:1
  • erchashu
    二叉树的链式存储、先序中序遍历和层次遍历。(构造一棵树并输入数据,编写三个函数,非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法(这里的非递归以中序为例)。在主程序中调用这三个函数进行树的遍历,观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。)(Chain store binary tree, preorder traversal and hierarchy traversal.)
    2013-12-07 23:16:06下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载