Search - Update

Search - Update - List

[Data structs] 数据结构（1） DL : 0: 以链表的形式实现货物的管理,包括链表的创建,插入,删除,查询,更新等.-to List in the form of cargo management, including Chain create, insert, delete, query, update, etc..
Date : 2026-01-23 Size : 1kb User : rank
[Data structs] lru-cache DL : 0: 使用LRU方法更新Cache 结合数据结构的相关知识，使用LRU的策略，对一组访问序列进行内部的Cache更新并附实验报告-use LRU Cache update method combining data structures and the related knowledge, the use of the LRU strategy the group visited a sequence within the Cache update accompanied experimental report
Date : 2026-01-23 Size : 14kb User : 小米
[Data structs] Family_tree DL : 0: 家谱用于记录某家族历代家族成员的情况与关系。现编制一个家谱资料管理软件，实现对一个家族所有的资料进行收集整理。支持对家谱的增加，删除，更新，统计等各项必须操作，并用计算机永久储存家族数据，方便随时调用。-genealogical records for a family history of members of the family and relationships. Preparation is a records management software, a family of all the information collected. Support for the family tree to add, delete, update, statistics and other necessary operations, and permanent storage of computer data family, convenience call.
Date : 2026-01-23 Size : 1.18mb User : Kong
[Data structs] problem1103(update) DL : 0: 浙江大学ACM练习题 1103 提交通过代码上一个包失误未付原码,十分抱歉!-Zhejiang University ACM 1103 Exercises code submitted through a packet errors unpaid original code, I am very sorry!
Date : 2026-01-23 Size : 30kb User :
[Data structs] 2501425708 DL : 0: 此程序用提升法实现第二代小波变换％％我用的是非整数阶小波变换％％采用时域实现,步骤先列后行％％正变换：分裂，预测，更新；％％反变换：更新，预测，合并％％只做一层（可以多层，而且每层的预测和更新方程不同）-the procedure used to upgrade method is the second generation wavelet transform%% I use a non-integer-order wavelet transform%% using time domain achieved, steps out first go backward%% transformation : split and forecast updates; %% inverse transformation : Update, forecasting, %% off with a layer (which can be multi-storey, but the typical forecast and updating different equation)
Date : 2026-01-23 Size : 1kb User : 刘树春
[Data structs] RTree_test DL : 0: C++实现的R树算法，包括构造，查找，增删改更新结点等。还有两个test文件。-C++ Achieved R tree algorithm, including the structure, find, additions and deletions and other changes to update nodes. There are two test files.
Date : 2026-01-23 Size : 14kb User : Y.A.M
[Data structs] btree DL : 0: 平衡二叉树操作的演示: 1、操作界面给出查找、插入、删除、退出等操作选择。 2、每种操作均要提示输入关键字。 3、每次插入或删除一个节点后，应更新平衡二叉树的显示（以凹入表形式显示）。 -Balanced binary tree operations Demo: 1, Operator Interface given to find, insert, delete, withdraw from the operation of choice and so on. 2, each operation must be prompted to enter a keyword. 3, each insert or delete a node, it should update the display of a balanced binary tree (in the form of indentation shown).
Date : 2026-01-23 Size : 240kb User :
[Data structs] viterbi416 DL : 0: 实现了（4，1，6）型卷积码的维特比译码算法，采用了极大似然算法。介绍了软判决维特比译码算法过程的三个步骤：初始化，度量更新和回溯译码。-Realize the (4,1,6)-type convolutional codes Viterbi decoding algorithm using the maximum likelihood algorithm. Introduce a soft-decision Viterbi decoding algorithm the process of three steps: initialization, update and backward decoding metric.
Date : 2026-01-23 Size : 3kb User : raymond
[Data structs] 456768 DL : 0: 数据结构课程设计平衡二叉树操作的演示 1.本程序演示平衡二叉树的插入,删除,查找,。 2.首先要先初始二叉树为空树； 3.接着要实现平衡二叉树的插入，删除，，其中根据平衡二叉树插入，删除的算法要不停的把插入的元素平衡地插入，需要调用平衡分析函数和左右旋转函数，更新平衡二叉树；删除元素后也要调用平衡分析函数和左右旋转函数，更新平衡二叉树。 4.平衡二叉树的查找则可根据查找算法实现。比较简单。 -Curriculum design data structure balanced binary tree demo one operation. This procedure demonstration balanced binary tree insertion, deletion, search,. 2. First of all, the initial first binary tree is empty tree 3. And then to achieve a balanced binary tree insertion, deletion, which under the balanced binary tree insertion, deletion of the algorithm to keep the inserted element balanced insertion, the need to call a balanced analysis of function and around rotating function, a balanced binary tree update delete the element after the call to function and balance analysis around rotating function, a balanced binary tree update. 4. A balanced binary tree search can be the basis of the search algorithm. Relatively simple.
Date : 2026-01-23 Size : 187kb User : 谭燕
[Data structs] tongjigongzi DL : 0: 1. 统计工资设计要求：（1）使用结构数组设计一个公司职员的数据结构，使用下述的结构定义： struct employee{ int age char name[15] double salary } （2）在主函数里构造一个数组company，用来存放职工信息。（3）设计update函数，用来对company中指定职员的信息进行更改。要求先按照name查询到相应的职员，然后修改并保存。（4）设计一个read函数，用来向company中录入职员信息，并显示结果。（5）编写mean函数求平均工资。应该能对全体职工或大于某一年龄的职工工资求和并计算平均值。（6）编写total函数对工资求和。应该能对全体职工或某一年龄段职工的工资求和。 -err
Date : 2026-01-23 Size : 6kb User : 龙君
[Data structs] avt DL : 0: 1.本程序演示平衡二叉树的插入,删除,查找,。 2.首先要先初始二叉树为空树； 3.接着要实现平衡二叉树的插入，删除，，其中根据平衡二叉树插入，删除的算法要不停的把插入的元素平衡地插入，需要调用平衡分析函数和左右旋转函数，更新平衡二叉树；删除元素后也要调用平衡分析函数和左右旋转函数，更新平衡二叉树。 4.平衡二叉树的查找则可根据查找算法实现。比较简单。-1. This procedure demonstration balanced binary tree insertion, delete, find,. 2. First of all, the initial first binary tree is empty tree 3. And then to achieve a balanced binary tree insertion, deletion, which under the balanced binary tree insertion, deletion of the algorithm to keep the inserted element balanced insertion, the need to call about a balanced analysis of function and rotating functions, balanced binary tree update delete elements have to call after the balance analysis functions and rotation function, update the balance tree. 4. Balanced binary tree can be the basis of the search algorithm to find. Relatively simple.
Date : 2026-01-23 Size : 254kb User : 张欣
[Data structs] Traversingbinarytreefinddeleteupdatedatasource DL : 0: 二叉树的遍历、查找、删除、更新数据的代码-Traversing binary tree, find, delete, update data source
Date : 2026-01-23 Size : 1kb User : 刘正朝
[Data structs] st DL : 0: 添加一个Button，更新视图，在函数内输入 Invalidate() -Add a Button, update the view, enter the function Invalidate ()
Date : 2026-01-23 Size : 1.81mb User : tmacq3
[Data structs] jiadian DL : 0: 数据结构课程设计，家电管理系统，包括家电的类型，型号（不能输入字母，如需要可以将型号int型改成char即可输入字母），数量，价格。可以创建，插入，删除，查询，打印，更新，销毁。-Data structures curriculum design, home appliance management system, including the type of appliance, model (not type the letter, if necessary, can be type int into a char type to enter letters), quantity, price. You can create, insert, delete, query, print, update, destroy.
Date : 2026-01-23 Size : 2kb User : 江浩
[Data structs] rmq DL : 0: Structure rsq(range sum query) help to find sum on segment l and r O(log(l-r+1)) and update O(logN)
Date : 2026-01-23 Size : 105kb User : ODDI
[Data structs] rsq DL : 0: Structure rmq(range minimum or maximum query) help to find minimum or maximum on segment l and r O(log(l-r+1)) and update O(logN)
Date : 2026-01-23 Size : 105kb User : ODDI
[Data structs] City DL : 0: 　　将若干城市的信息，存入一个带头结点的单链表。结点中的城市信息包括：城市名，城市的位置坐标。要求能够利用城市名和位置坐标进行有关查找、插入、删除、更新等操作。-The number of towns and cities, into a single list to take the lead node. Nodes in the city information, including: City name, the city coordinates. Required to use the city name and location coordinates of the find, insert, delete, update, and other operations.
Date : 2026-01-23 Size : 2kb User : clement
[Data structs] 5 DL : 0: 员工管理系统查询员工信息插入员工信息更新员工信息-Staff management system query employee information into the Employee Information Update employee information
Date : 2026-01-23 Size : 45kb User : wang
[Data structs] update-and-delete DL : 0: 用链表实现对数据的增查删改，可以把记录保存到文件数据库中-Achieved with the list of data deletion by check, the file can be saved to the database record
Date : 2026-01-23 Size : 251kb User : 王凯
[Data structs] update DL : 0: 根据邻接矩阵求得图中两个结点之间的最短路径，其中最短路径是指从一个结点到另一个结点的步数，然后再增加一条弧，更新距离矩阵。-Update the distant matrix.
Date : 2026-01-23 Size : 7.97mb User : hannea

« 12 »