Search - TI - CodeBus

Search - TI - List

[Data structs] pai xu wen ti DL : 0: 几种基本的排序算法 ,希望对某些人有点帮助-several basic sorting algorithm, and I hope to help some people a bit
Date : 2025-12-25 Size : 1kb User : 刘华宾
[Data structs] huffmancode111 DL : 0: huffman完整源代码C语言实现，有本人超级详细解释（看不懂你去跳楼吧）算法设计: 1、对给定的n个权值{W1,W2,W3,...,Wi,...,Wn}构成n棵二叉树的初始集合F={T1,T2,T3,...,Ti,...,Tn}，其中每棵二叉树Ti中只有一个权值为Wi的根结点，它的左右子树均为空。（为方便在计算机上实现算法，一般还要求以Ti的权值Wi的升序排列。） 2、在F中选取两棵根结点权值最小的树作为新构造的二叉树的左右子树，新二叉树的根结点的权值为其左右子树的根结点的权值之和。 3、从F中删除这两棵树，并把这棵新的二叉树同样以升序排列加入到集合F中。 4、重复二和三两步，直到集合F中只有一棵二叉树为止。 -Huffman complete C source code language, I have super-detailed explanation (you do not understand it jumped) algorithm design : one, the right to the right values n (W1, W2, W3 ,..., Wi ,..., Wn) n trees constitute the binary tree initial pool F = (T1, T2, T3, ... Ti ,..., Tn), which is indeed a binary tree Ti only a right to the value of Wi Root. it's about subtrees are empty. (For the convenience of the computer algorithm, the general also demanded the right to Ti Wi value of ascending.) 2. in 1984 two F Root weights smallest tree as a new structure of the binary tree around subtrees, new Binary Tree Root in the right value for their son around the tree Root and the right value. 3, F deleted from this two trees, and how the new binary tree in the same ascending into the pool F. 4, re
Date : 2025-12-25 Size : 11kb User : 乐乐
[Data structs] ex DL : 0: 最佳调度问题，假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。 -Optimal scheduling problem, assuming that n has a mission by the k-parallel machine to complete the work. I need to complete the mission time for ti. Try to design an algorithm to find n complete this task the best scheduling, making the time to complete a full first mission.
Date : 2025-12-25 Size : 1kb User : 朱亚华
[Data structs] duochuzuiyoufuwucixuwenti DL : 0: 多处最优服务次序问题，设有N个顾客同时等待一项服务。顾客i需要的服务时间为ti，共有s处可以提供此项服务，应如何安排n个顾客的服务次序才能使平均等待时间达到最小。-Optimal order of multiple services, with N of customers waiting for a service at the same time. I need to service customers time ti, a total of s Office can provide the service, how to arrange a customer service n order to make the average waiting time to a minimum.
Date : 2025-12-25 Size : 1kb User : 李碧莲
[Data structs] Huffman DL : 0: 用vc++实现用最短路径查找哈弗曼树。n个权值构成n棵二叉树的集合F={T1, T2, …, Tn}，其中每棵二叉树Ti中只有一个带树为Ti的根结点。-Achieved with the vc++ to find the shortest path tree Havermann. n-weight constitutes a collection of n binary trees F = (T1, T2, ..., Tn), which is only a Ti binary Each species of tree with the root node for the Ti.
Date : 2025-12-25 Size : 1kb User : liangsi
[Data structs] mi-gong-wen-ti DL : 0: 通过队列和栈实现迷宫问题最后走出迷宫设置上下左右的路线不断的进行出战和入栈 -Achieved through the queue and a stack maze of issues about the final out of the maze of setting up and down the line played and continue to conduct stack
Date : 2025-12-25 Size : 2kb User : maomaoyu
[Data structs] windows DL : 0: 八皇后问题在一个八乘以八的表格中放入皇后使其不能在一天直线上同时出现两个皇后-ba ge huang hou wen ti
Date : 2025-12-25 Size : 3.68mb User : 齐永意
[Data structs] migong DL : 0: 迷宫问题,堆栈的描述，适合初学者，简单易学-C mi gong wen ti
Date : 2025-12-25 Size : 1kb User : heyaff
[Data structs] NetSimulator DL : 0: 本课题假设ti为广播基站数据包(单位数据包大小为512bits)的发布时刻，令发布时间间隔Xi = ti - ti-1 (i=0, 1, 2, …)，t0 = 0，则任意Xi满足负指数分布： p{Xi ≥ t} = p0(t) = , t ≥ 0 或者 p{Xi < t} = 1-p0(t) =1- , t ≥ 0 该负指数分布的广播包发布时间间隔的均值为1/λ。假设处理一个数据包的时间为0.05s，令λ分别等于5Kbps和1Kbps时，在100s时间内，求出数据包的平均队长。基本要求：（1）将以上过程用程序模拟运行出来；（2）注意数据结构的选择，实物演示时要求讲出程序原理。提高要求：（1）可动态调整数据包处理时间、λ值、单位数据包大小和总时间等；（2）程序操作友好、图形界面美观。-The topic for the radio base station assuming ti packets (packet size for the unit 512bits) release time, release time interval so that Xi = ti- ti-1 (i = 0, 1, 2, ...), t0 = 0, then any Xi satisfy the negative exponential distribution: p {Xi ≥ t} = p0 (t) =, t ≥ 0 or p {Xi <t} = 1-p0 (t) = 1-, t ≥ 0 The negative exponential distribution of the broadcast packet release interval of mean 1/λ. Suppose a packet processing time for 0.05s, so that λ is equal to 5Kbps and 1Kbps respectively, in the 100s time, find the average packet captain. Basic requirements: (1) the above process simulation applications run out (2) Note that the choice of data structure, the physical presentation of the program when asked about the principle. Increased requirements: (1) can be dynamically adjusted data packet processing time, λ value, the unit packet size and the total time (2) program operation and friendly, graphical interface appearance.
Date : 2025-12-25 Size : 2.42mb User : luyu
[Data structs] Queen-Collisions DL : 0: 八皇后问题的经典算法,参加ACM竞赛时的代码！-ba huang hou wen ti!
Date : 2025-12-25 Size : 1kb User : liuwu
[Data structs] yuesefu DL : 0: 实现约瑟夫环问题编号是1，2，……,n的n个人按照顺时针方向围坐一圈，每个人只有一个密码（正整数）。一开始任选一个正整数作为报数上限值m,从第一个仍开始顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向的下一个人开始重新从1报数，如此下去，直到所有人全部出列为止。设计一个程序来求出出列顺序。-shi xian yue se fu huan wen ti
Date : 2025-12-25 Size : 11kb User : 王明