Search - Unknown

Search - Unknown - List

[Data structs] erfenfa2 DL : 0: 非递归调用的二叉查找法：初始化一个数组，提示输入待查元素，返回查找的结果和查找次数-non- recursive call the binary search method : an array initialization, suggesting that the importation of unknown origin elements, return to the search results and the number of search
Date : 2025-12-29 Size : 1kb User : 刘莹
[Data structs] dongtai DL : 0: 算法 | 微机及接口技术 | 管理信息系统 | 信号与系统 | 网络通信/技术 | 数据库系统原理 | 数据库及其应用 | 计算机应用技术严蔚敏《数据结构(c语言版)习题集》算法设计题第八章答案作者名：不详　来源：网友提供 05年7月7日第八章动态存储管理-Algorithm | Computer and Interface Technology | Management Information System | Signals and Systems | Network Communication/Technology | Principles of Database Systems | Database and Its Application | Computer Application Technology Yan Wei Min data structure (c language version) Exercise collection algorithm design title of Chapter VIII The answer Author Name: Unknown Source: Netizen provide July 7, 2005 Chapter VIII of the dynamic memory management
Date : 2025-12-29 Size : 2kb User : feng
[Data structs] zidian_shu DL : 0: 高效的字符串查找数据结构，所须查找的长度和字符串的数量没有关系，只和待查的字符串的长度有关。而一般的字字符串查找的时间复杂度为常数级别。 -Efficient data structure to find the string which will be needed to find the length and the number of string does not matter, only, and of unknown origin related to the length of the string. The general character of the string to find the time complexity is a constant level.
Date : 2025-12-29 Size : 1kb User : sinamaster
[Data structs] 1840 DL : 0: POJ1840求一个有5位未知数方程解的个数,hash表的经典应用-POJ1840 seeking a five unknown number of equations, hash table classic application
Date : 2025-12-29 Size : 1kb User : cx
[Data structs] 3 DL : 0: 实现二分法求解方程。编写并使用以下函数： double SolveRoot(double(*pf)(double x),double a,double b,int n) 这里，pf指向一个函数f，f用来定义要求解的方程f(x)=0，a和b是未知解x的上下界（即a<=x<=b)， n是循环次数。例如，如果f(x)=x*x-2，则SolveRoot (f,1,2,100)将返回1.414213562373095，即方程为x*x=2的解。二分法的原理是反复地把区间分为两个相等区间，然后用其中含有解的一半代替该区间，依次类推，得到满足精度的解。它通过检查f(a)和f(b)的符号来判断解是否在区间中。-Achieve the dichotomy solve the equations. To prepare and use the following function: double SolveRoot (double (* pf) (double x), double a, double b, int n) here, pf points to a function f, f used to define the required solution of the equation f (x) = 0 , a and b are unknown solution x of the upper and lower bounds (ie, a < = x < = b), n is the cycle number. For example, if f (x) = x* x-2, then the SolveRoot (f, 1,2,100) will return 1.414213562373095, that is, the equation x* x = 2 solution. Dichotomy of the principle is repeatedly the range is divided into two equal intervals, then half of them containing solution instead of the interval, and so on, accuracy of the solution are met. It does this by checking f (a) and f (b) solutions of the symbol to determine whether the interval.
Date : 2025-12-29 Size : 1.11mb User : 闻悦
[Data structs] zhebanchazhao DL : 0: 折半查找的算法。将数列按有序化(递增或递减)排列，查找过程中采用跳跃式方式查找，即先以有序数列的中点位置为比较对象，如果要找的元素值小于该中点元素，则将待查序列缩小为左半部分，否则为右半部分。通过一次比较，将查找区间缩小一半。 -Binary search algorithm. The series by ordering (ascending or descending) order, find the process of using leap way to find that the first series of the mid-point of an orderly place to compare objects to find the element if the value is less than the midpoint of the element, will reduce the left part of the sequence of unknown origin, otherwise the right half. Through a comparison, will narrow the search interval by half.
Date : 2025-12-29 Size : 167kb User : 张驰
[Data structs] zhebanchazhao DL : 0: 依次输入顺序表的各个元素，然后进行关键字的查找，如果存在则返回待查元素位置，否则显示不存在-Followed by the various elements of the input sequence table, and then keyword search, if there is element of unknown origin location is returned, otherwise the show does not exist
Date : 2025-12-29 Size : 1kb User : 王安东
[Data structs] joseph DL : 0: 编号为1,2,...,n的n个人按顺时针方向坐在圆桌边, 每人持有一密码(正整数),从第s人开始报数, 报到第m人出列, 再从下一人开始报, 直至所有的人都出列为止-Joseph Central C-list resolution process www.firnow.com Time: 2008-01-26 Author: Unknown Editor: andyyoo Views: 1557 [review] comprehensive resource book community numbered 1,2 ,..., n of n people sitting round table clockwise, each holding a password (positive integer), from the first s are beginning to report the number of people out to report the first m columns, and then people began to report from the next, until all of them so far out of line
Date : 2025-12-29 Size : 1kb User : leejam
[Data structs] finding DL : 0: 折半查找的算法思想是将数列按有序化(递增或递减)排列，查找过程中采用跳跃式方式查找，即先以有序数列的中点位置为比较对象，如果要找的元素值小于该中点元素，则将待查序列缩小为左半部分，否则为右半部分。通过一次比较，将查找区间缩小一半。折半查找是一种高效的查找方法。它可以明显减少比较次数，提高查找效率。但是，折半查找的先决条件是查找表中的数据元素必须有序。 -Binary search algorithm idea is to sequence by ordering (ascending or descending) order, find the process using jump way to find that the first series to the middle point of order to compare objects to find the element value is less than if The midpoint of the element of unknown origin will be reduced for the left part of the sequence, otherwise the right half. Through a comparison, will look for half the interval narrowing. Binary search is an efficient search method. It can significantly reduce the number of comparisons to improve search efficiency. However, the binary search lookup table is a prerequisite for the data elements must be orderly.
Date : 2025-12-29 Size : 1kb User : zn
[Data structs] haxichazhao DL : 0: 依次输入关键字并建立哈希表，进行关键字查找。如果存在则返回待查元素的位置，否则显示不存在。-Enter keywords and in turn create the hash table, a keyword search. If there are elements of the location of unknown origin is returned, otherwise the show does not exist.
Date : 2025-12-29 Size : 1kb User : lianyu
[Data structs] zheban DL : 0: 依次输入顺序表中的各个元素，然后进行关键字查找。如果存在则返回待查元素的位置，否则显示不存在。-Input sequence in turn each element in the table, and then keyword search. If there are elements of the location of unknown origin is returned, otherwise the show does not exist.
Date : 2025-12-29 Size : 1kb User : lianyu
[Data structs] shunxuchazhao DL : 0: 依次输入顺序表中的各个元素，然后进行关键字查找。如果存在则返回待查元素的位置，否则显示不存在。-Input sequence in turn each element in the table, and then keyword search. If there are elements of the location of unknown origin is returned, otherwise the show does not exist.
Date : 2025-12-29 Size : 1kb User : lianyu
[Data structs] adjust DL : 0: 有一个自适应单链表。这个链表只能从最前端开始顺序单向查找待查元素；每次查找到一个元素后把它提升到链表的最前端，维持其他元素的相对关系不变。现在用该链表存储并查找正整数：给出一些待查的正整数，如果找到则输出查找过程中访问过的元素数目, 如果找不到，则输出-1. 输入第一行包含两个整数 n, m，即链表中元素的个数和查找的次数。第二行包含 n 个正整数，从链表前端开始依次序给出链表中的元素。这些元素保证两两不相等。以下 m 行每行包含一个正整数 c，表示一个待查元素。 -Have an adaptive single linked list. This list can only start from the front one-way in order to find a complete set of elements each element to find a list after it raised to the forefront, to maintain the relative relationship between the other elements remain unchanged. Now stored with the list and look for positive integers: given some unknown positive integer, if the search process to find the output number of elements visited, if not found, output-1. Input The first line contains two integers n, m, that is, the number of elements in the list and find the number of times. The second line contains n positive integers, starting from the front of the list given by the order of the elements of the list. These elements ensure the pairwise equal. The following m lines each line contains a positive integer c, represents an unknown element.
Date : 2025-12-29 Size : 6kb User : huangda
[Data structs] lu-jing-guihua DL : 0: 这是对未知路径的动态规划探讨的文档，主要包括： A*算法的基本理论 A*算法的理论 A*算法的实现-This is the unknown path dynamic planning of documents, including: The basic theory of A* algorithm The A* algorithm theory The A* algorithm to achieve
Date : 2025-12-29 Size : 167kb User : 朱茵茵
[Data structs] suiji DL : 0: 利用随机化算法对顺序表进行搜索：  随机抽取有序表元素；  从最接近待查元素开始搜索。 -The use of randomized algorithms search order table:  randomly selected from the ordered list of elements  start the search from the closest to the unknown element.
Date : 2025-12-29 Size : 1kb User : 武叶
[Data structs] Fortran2 DL : 1: 这是一个采用平面四边形八节点等参单元的平面有限元分析程序。 PROGRAM PLANEFEM IMPLICIT REAL*8(A-H,O-Z) CHARACTER*80 LINECHAR,NEWLINECHAR COMMON A(30000),L(4000) COMMON /SOL/NPOIN,NELEM,NTYPE,NMATS OPEN(5,FILE= FEMDATA ,STATUS= OLD ) OPEN(6,FILE= FEMOUT ,STATUS= UNKNOWN ) C 以下进行的是从数据文件FEMDATA中读入数据文件主标题信息。 READ(5,5000) LINECHAR LOCATECHAR=INDEX(LINECHAR, 输入 ) IF(LOCATECHAR.NE.0) THEN LINECHAR(LOCATECHAR:LOCATECHAR+3)= 输出 - 这是一个采用平面四边形八节点等参单元的平面有限元分析程序。 PROGRAM PLANEFEM IMPLICIT REAL*8(A-H,O-Z) CHARACTER*80 LINECHAR,NEWLINECHAR COMMON A(30000),L(4000) COMMON /SOL/NPOIN,NELEM,NTYPE,NMATS OPEN(5,FILE= FEMDATA ,STATUS= OLD ) OPEN(6,FILE= FEMOUT ,STATUS= UNKNOWN ) C 以下进行的是从数据文件FEMDATA中读入数据文件主标题信息。 READ(5,5000) LINECHAR LOCATECHAR=INDEX(LINECHAR, 输入 ) IF(LOCATECHAR.NE.0) THEN LINECHAR(LOCATECHAR:LOCATECHAR+3)= 输出
Date : 2025-12-29 Size : 11kb User : 张蕊
[Data structs] 6226754PLANEFEM DL : 0: PROGRAM PLANEFEM IMPLICIT REAL*8(A-H,O-Z) CHARACTER*80 LINECHAR,NEWLINECHAR COMMON A(30000),L(4000) COMMON /SOL/NPOIN,NELEM,NTYPE,NMATS OPEN(5,FILE= FEMDATA ,STATUS= OLD ) OPEN(6,FILE= FEMOUT ,STATUS= UNKNOWN ) C 以下进行的是从数据文件FEMDATA中读入数据文件主标题信息。 READ(5,5000) LINECHAR LOCATECHAR=INDEX(LINECHAR, 输入 ) IF(LOCATECHAR.NE.0) THEN LINECHAR(LOCATECHAR:LOCATECHAR+3)= 输出 -PROGRAM PLANEFEM IMPLICIT REAL*8(A-H,O-Z) CHARACTER*80 LINECHAR,NEWLINECHAR COMMON A(30000),L(4000) COMMON /SOL/NPOIN,NELEM,NTYPE,NMATS OPEN(5,FILE= FEMDATA ,STATUS= OLD ) OPEN(6,FILE= FEMOUT ,STATUS= UNKNOWN ) C 以下进行的是从数据文件FEMDATA中读入数据文件主标题信息。 READ(5,5000) LINECHAR LOCATECHAR=INDEX(LINECHAR, 输入 ) IF(LOCATECHAR.NE.0) THEN LINECHAR(LOCATECHAR:LOCATECHAR+3)= 输出
Date : 2025-12-29 Size : 7kb User : 张蕊
[Data structs] new-DV-Hop-code DL : 0: 改进DV-Hop定位算法首先设置初始量，布置了一个范围为100×100m2的区域，其上随机分布100个传感器节点，其中有10个信标节点，节点的通信半径为30m。第二步在正方形区域内产生均匀分布的随机拓扑，随机产生节点坐标并将其中十个选定为信标节点，其余九十个设为未知节点，然后画出节点分布图。第三步通过最短路径法计算未知节点与每个信标节点的最小跳数。第四步根据前面记录的其他信标节点的位置信息和相距跳数估算平均每跳的实际距离，用跳数估计距离的方法得出未知节点到信标节点的距离。第五步用极大似然估计法求未知节点坐标 (Improved DV-Hop localization algorithm first set the initial amount, layout 100100m2 the area of a range of 100 sensor nodes randomly distributed on the 10 beacon node, the node communication radius of 30m. The second step in the square area to generate uniformly distributed random topology, random coordinates of the nodes and ten of the selected beacon node, the remaining 90 is set to unknown node, and then draw the node distribution diagram. The third step is to calculate the minimum number of hops of the unknown node and each beacon node through the shortest path method. The fourth step according to the location information of the other beacon nodes in the previous record and away from hops to estimate the average hop distance and hop count to estimate the distance to come to the distance of the unknown node to beacon nodes. The fifth step maximum likelihood estimation method and the unknown coordinates of the nodes)
Date : 2025-12-29 Size : 1kb User : robinkk4