登录
首页 » 数据结构 » C++面试试题,值得一看

C++面试试题,值得一看

于 2022-03-06 发布 文件大小:2.98 kB
0 121
下载积分: 2 下载次数: 1

代码说明:

C++面试试题,值得一看-C interview questions, the eye-catcher

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

发表评论

0 个回复

  • 备份与恢复源码,给需要的一个参考,可以直接运行
    数据备份与恢复源码,给需要的一个参考,可以直接运行-Data backup and recovery source, a reference to the need, you can directly run
    2022-08-14 20:53:26下载
    积分:1
  • Backward recursive method used to achieve the eight
    使用回溯递归法实现的八皇后问题的算法源码-Backward recursive method used to achieve the eight-queen problem algorithm source code
    2022-11-08 16:40:02下载
    积分:1
  • 一元稀疏多项式计算器的基本功能是: (1)输入并建立多项式; (2)输出多项式,输出形式为整序列:n,c1,e1,c2,e2,….,cn,en,...
    一元稀疏多项式计算器的基本功能是: (1)输入并建立多项式; (2)输出多项式,输出形式为整数序列:n,c1,e1,c2,e2,….,cn,en, 其中n是多项式的项数,ci和ei分别是第I项的系数和指数,序列按照指数降序排列; (3)多项式a和b相加,建立多项式a+b (4)多项式a和b相减,建立多项式a-b.-Sparse Polynomial calculator a dollar a basic function is to: (1) input and the establishment of polynomials (2) the output polynomial, the output sequence of the form of an integer: n, c1, e1, c2, e2, ...., Cn , en, in which n is the number of polynomial, ci and ei, respectively, is the first I of the coefficient and index, sequence in accordance with the index in descending order (3) polynomials a and b are added together to establish polynomial A2B ! b (4) polynomials a and b-phase reduction, the establishment of polynomial ab.
    2022-07-02 13:56:33下载
    积分:1
  • Volume 3 for sorting and searching, this is the book of a revised edition, it is...
    卷3为分拣和搜索,这是本书的第1个修订版,它是对计算机分拣和搜索的一流技术的最全面的研究,它扩展了卷1中数据结构的处理方法,将大小数据库以及内存和外部存储都包含在内。本书包括对计算机方法仔细检查的选择方案,和其效率的大量分析。本书该版的独特之处在于优化了的分拣,以及对通用散列法和排列法的新的理论论述。-Volume 3 for sorting and searching, this is the book of a revised edition, it is sorted on the computer and search the first-class technology of the most comprehensive study of its expansion Volume 1 data structure handling methods, the size of the database and external memory and storage are included. The book including computer methods carefully examined the options, and its efficiency lot of analysis. The book version of the unique features of the optimization is sorted, and right hash law and common law with the new theoretical expositions.
    2022-02-21 11:03:10下载
    积分:1
  • 哈夫曼树算法 根给定的n个权值{w1,w2,……wn},造n棵只有根点的二叉树,令起权值为wj 在森林中选取两棵根点权值最小的树作左右子树,造...
    哈夫曼树算法 根据给定的n个权值{w1,w2,……wn},构造n棵只有根结点的二叉树,令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树,构造一棵新的二叉树,置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树,同时将新得到的二叉树加入森林中 重复上述两步,直到只含一棵树为止,这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree
    2023-05-05 13:05:03下载
    积分:1
  • 大型 作业3.1输入一个列L,生成一棵二叉排序树T;3.2对二叉排序树T作中序遍历,输出果;3.3计算二叉排序树T的平均查找长度, 输出果...
    数 据 结 构 大型 作业3.1输入一个数列L,生成一棵二叉排序树T;3.2对二叉排序树T作中序遍历,输出结果;3.3计算二叉排序树T的平均查找长度, 输出结果;3.4判断二叉排序树T是否为平衡二叉树,输出信息“OK!”/“NO!”;3.5再使用上述数列L,生成平衡的二叉排序树BT,每当插入新元素,发现当前的二叉排序树BT不是平衡的二叉排序树,则立即将它转换成新的平衡的二叉排序树BT;3.6计算平衡的二叉排序树BT的平均查找长度,输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of
    2022-04-09 01:41:30下载
    积分:1
  • 哈夫曼树编码
    资源描述将字符串转化为哈夫曼编码,也能将哈夫曼编码转化为字符
    2022-11-26 08:10:13下载
    积分:1
  • 一套反出来的股票分析软件,对于分析程序有一定的帮助....
    一套反出来的股票分析软件,对于分析程序结构和数据结构有一定的帮助.-By a set of anti-stock analysis software for the analysis of program structure and data structure have some help.
    2022-04-10 01:17:17下载
    积分:1
  • 车厢重排,一个c++习题
    车厢重排,一个c++数据结构习题-compartments rearrangement, a data structure c Exercises
    2022-05-22 11:57:54下载
    积分:1
  • 企业职员信息管理系统
    企业职员信息管理系统-enterprise information management system
    2022-06-26 20:26:37下载
    积分:1
  • 696518资源总数
  • 105540会员总数
  • 37今日下载