Search - section

Search - section - List

[Data structs] 线性表元素删除 DL : 0: 线性表元素删除运算,删除线性表L中第i个位置上的元素-linear elements to delete Table Operational delete Table L linear section i positions on the elements
Date : 2025-12-14 Size : 1kb User : 林
[Data structs] SortTest DL : 0: 说明: 这一段在复习数据结构和算法，有一些零星笔记，在Others这个归类下，欢迎指正。对于排序算法，想做一个动态演示的东东，因此今天使用VB.net大概实现了一个，界面如下，代码有2个版本，一个可以指示当前循环的位置（但设计感觉不好，也找不到更好的办法），一个没有。 -Note : This section of the review of data structure and algorithm, a few scattered notes, in the classified Others, welcomed the correction. For Sorting Algorithm and do a demonstration of the dynamic page, and it is probably using VB.net achieved one of the following interface, the code has two versions, one can instruct the current cycle position (but feel bad design, but also find better ways), a no.
Date : 2025-12-14 Size : 139kb User :
[Data structs] 200410610511675180 DL : 0: XMathLib是一个通用的3D图形数学库。其中包含两个部分： XMathLib和XGeomLib。分别处理数学和几何运算。数学部分包含向量、矩阵、四元数的运算。以及其它的运算。几何部分包含Box Frustum AABB OBB Ray Line Line-Segment Plan Triangle等的运算。-XMathLib is a generic 3D graphics math. Which consists of two parts : XMathLib and XGeomLib. Separate processing mathematical and geometric computing. The math section includes vector, matrix, quaternion arithmetic. , And other arithmetic. Geometric part consists Box Frustum AABB OBB Ray Line Line-Segme nt Plan Triangle such arithmetic.
Date : 2025-12-14 Size : 25kb User : dexter
[Data structs] hfafumanbianmawenti DL : 0: 对任意输入的一段英文，为每个字符编制其相应的赫夫曼编码；并利用该编码为任意输入的0、1序列进行解码． -the indiscriminate importation of the English section to the preparation of each character corresponding Hefuman coding; The coding and use of indiscriminate importation of 0, a sequence decoder.
Date : 2025-12-14 Size : 71kb User : jason
[Data structs] literature_research.ZIP DL : 0: 一个文本分析程序。实现分析一段文本中字母，N个字母的单词和具体单词出现的次数。-a text analysis program. Implementation Analysis section of the text of letters, the N-word letter word and the specific number.
Date : 2025-12-14 Size : 1kb User : 金琦
[Data structs] shujujiegousuanfahuffamn DL : 0: 输入一段文本，统计其中字符出现的频率设计相应的哈夫曼码并完成对该段文本的编码与译码-input section of the text, statistics on the frequency of characters designed corresponding Huffman code and the complete text of the coding and decoding
Date : 2025-12-14 Size : 2kb User : fanghe
[Data structs] myshortpath DL : 0: 图的最短路径，值得学习的一段代码。。。。值得大家参考-map of the shortest path, we should learn from the code section. . . . Worthy of our reference
Date : 2025-12-14 Size : 1kb User : 杰克逊
[Data structs] hafuman DL : 0: 哈夫曼编码/译码利用克鲁斯卡尔算法计算一段传输数据的哈夫曼编码，以提高信道利用率。-Huffman encoding/decoding algorithm using Kruskal data section of the Huffman coding, in order to improve channel utilization.
Date : 2025-12-14 Size : 8kb User : 毕小凯
[Data structs] JosephusProblem DL : 0: 據說著名猶太歷史學家 Josephus有過以下的故事：在羅馬人佔領喬塔帕特後，39 個猶太人與Josephus及他的朋友躲到一個洞中，39個猶太人決定寧願死也不要被敵人到，於是決定了一個自殺方式，41個人排成一個圓圈，由第1個人開始報數，每報數到第3人該人就必須自殺，然後再由下一個重新報數，直到所有人都自殺身亡為止。然而Josephus 和他的朋友並不想遵從，Josephus要他的朋友先假裝遵從，他將朋友與自己安排在第16個與第31個位置，於是逃過了這場死亡遊戲。-It is said that the famous Jewish historian Josephus has the following story: In the Roman occupation of乔塔帕特after 39 Jews and Josephus and his friends hid in a cave, 39 Jewish spiritual sense of the word should not be decided by the enemy that decided a means of suicide, 41 individuals formed a circle, from one individual to start off, each reported a few to the first 3 people to be the person to commit suicide, and then re-reported by the next number until all committed suicide so far. However, Josephus and his friends do not want to comply, Josephus to his friends to pretend to follow, he will be friends with their own arrangements in section 16 with the first 31 positions, so escaped the death game.
Date : 2025-12-14 Size : 4kb User : 王凌云
[Data structs] C6 DL : 0: 韩国2002年出版的c语言习题（本节主演关于数据结构和常用算法）-Korea published in 2002 c language exercises (starring in this section on commonly used data structures and algorithms)
Date : 2025-12-14 Size : 12kb User : zqm
[Data structs] goodjsq DL : 0: 设计一个简单的计算器类（类型），要求：（1）从键盘读入算式。（2）可以进行加、减、乘、除运算。（3）运算要有优先级。（4）用户可以按任何的运算符出现顺序进行输入。（5）不限定用户输入的计算式的长度。（6）有排错功能，当用户输入错误的算式时提示用户。例如，如果用户输入：3 + 4 * 5 - 7，计算结果应为16。（提示：可以使用本节所定义的栈类来帮助进行处理）。-Design a simple calculator-type (type), requirements: (1) Reading from the keyboard into the formula. (2) can add, subtract, multiply, with the exception of computing. (3) The operator must have priority. (4) the user can press any of the emergence of the order of operator input. (5) does not limit the user to enter the length of the calculation formula. (6) have debugging function, when the user enters the wrong formula when prompts the user. For example, if a user enters: 3+ 4* 5- 7, the calculation results should be 16. (Hint: You can use this section of the stack type definition to help to deal with).
Date : 2025-12-14 Size : 2kb User : wangmeng
[Data structs] HuffmanTree DL : 0: 对任意输入的一段英文，为每个字符编制其相应的赫夫曼编码；并利用该编码为任意输入的0、1序列进行解码.（1）初始化：从终端读入一段英文字符，统计每个字符出现的频率，建立赫夫曼树，并将该树存入某文件；（2）编码：利用建好的赫夫曼树对各字符进行编码，用列表的形式显示在屏幕上，并将编码结果存入另一文件中；（3）解码:利用保存的赫夫曼编码，对任意输入的0，1序列能正确解码。-A section of the indiscriminate importation of English, for each character the preparation of their corresponding Huffman coding and use the coding for arbitrary input sequence decoding 0,1. (1) Initialization: read from the terminal section of the English characters, statistical frequency of each character, the establishment of Huffman tree, and the tree into a document (2) Coding: Using the Huffman tree is built on the character encoding, using the list displayed on the screen and coding the results into another document (3) decoder: Using saved Huffman coding, for arbitrary input sequences correctly decode 0,1.
Date : 2025-12-14 Size : 17kb User : 侯健
[Data structs] data_struct DL : 0: 这是有关中科大的数据结构PPT，可供大家学习，尤其是考研的朋友参考！-This is the data structure DAYANG PPT, for everyone to learn, especially the study section of the reference of a friend!
Date : 2025-12-14 Size : 344kb User : jack
[Data structs] datastructureinoop DL : 0: 考研参考书《数据结构（用面向对象方法和C++描述）》(殷人昆)大部分课后题答案-Study section of the reference book data structure (object-oriented methods and C++ Description) (殷人Queensland) Most after-school question answers
Date : 2025-12-14 Size : 547kb User : spyman
[Data structs] BinaryTree DL : 0: 二叉树的实现功能：（1）生成二叉树（2）先序遍历（3）后序遍历（4）中序遍历（5）二叉树的高度（6）统计数的节点数-Realization of Binary Tree functions: (1) to generate binary tree (2) first traversal (3) after traversal (4) traversal (5) binary tree of height (6) of section statistics Points
Date : 2025-12-14 Size : 1kb User : feixiaoxing
[Data structs] huffman DL : 0: 输入一段英文字符，试为该文中的每个字符编制相应的哈夫曼码。（1）I：初始化（Initialization）。对输入的一段英文中的每个字符统计其权值，建立哈夫曼树；（2）E：编码（Encoding）。利用已建好的哈夫曼树，对每个字符进行编码。（3）D：译码（Decoding）。利用已建好的每个编码，对输入的一个由0、1组成的序列进行译码；（4）P：印代码文件（Print）。将每个字符编的哈夫曼码和译码结果显示在终端上。 -Enter a period of English characters, try the text for each character corresponding Huffman code. (1) I: Initialization (Initialization). A section of the input English characters statistics for each value of its right to establish a Huffman tree (2) E: encoding (Encoding). Has been built using Huffman tree for each character encoding. (3) D: Decoding (Decoding). Use has been completed for each encoding, the input of a sequence consisting of 0,1 Decoding (4) P: Printing code files (Print). Will be allocated for each character code and the Huffman decoding results are displayed in terminal.
Date : 2025-12-14 Size : 2kb User : alic
[Data structs] puzzle DL : 0: 迷宫求解。数据结构科重要程序。通过C语言实现。能正常运行。但需要帐户才能下载。请见谅。-Solving the maze. Data Structure Section of key steps. Through the C language. To normal operation. However, the need to account to download. Sorry.
Date : 2025-12-14 Size : 1kb User : 李芳
[Data structs] zju_DS DL : 0: 《浙大数据结构》本复习稿件仅适合复习浙大的CS，覆盖了浙大的所有考点，并附有最近两年的本科生试题以及解答，希望对考研的同学有点用处- Zheda data structure The only review manuscripts for review Zheda of CS, covering all Zheda test, with the last two years of undergraduate examination papers and answer questions, and they hope to study section of the students a bit useless
Date : 2025-12-14 Size : 236kb User : fei06
[Data structs] DataStructoPractice DL : 0: 各个大学数据结构练习题集合考研期末考试试题包含可做考试学习参考资料-Data structure in various university collections Exercises at the end of study section of the examination papers contain references to learn to do the examination
Date : 2025-12-14 Size : 773kb User : dujia
[Data structs] the-loop-section DL : 0: 用深度搜索方法求polya定理中置换群的循环节。-Depth search method and the loop section of the permutation group in polya Theorem.
Date : 2025-12-14 Size : 875kb User : 张淑静

« 12 3 4 5 »