Search - hill

Search - hill - List

【Other】 The_Art_of_Electronics_2nd_ed._-_P._Horowitz-_W._ DL : 0: The Art Of Electronics - 2nd Edition Paul Horowitz, Harvard UNIVERSITY Winfield Hill ROWLAND INSTITUTE FOR SCIENCE. CAMBRIDGE, MASSACHUSETTS, CAMBRIDGE UNIVERSITY
Update : 2024-05-08 Size : 23371776 Publisher : cele
【Algorithm】 CPP DL : 0: c++一些常用排序算法演示(插入、希尔、冒泡、快速等)，100 可以运行且能直接调用-c++ some commonly used sorting algorithm demo (insert, Hill, bubbling, fast, etc.), 100 run can directly call
Update : 2024-05-08 Size : 11264 Publisher : colon
【Other】 phaseScreenSubvi(Hill-model) DL : 0: 光通信中涉及大气湍流效应，该程序设计了一种大气湍流类型，可进行大气湍流仿真。-Involved in atmospheric turbulence effects in optical communication, the program design of a type of atmospheric turbulence, atmospheric turbulence simulation.
Update : 2024-05-08 Size : 9216 Publisher : 王一帆
【2D Graphic】 yunxuan DL : 0: 晕渲算法，C++写成，输入DEM文件输出BMP文件-The hill shading algorithm, C++ written input DEM file output to BMP file
Update : 2024-05-08 Size : 4148224 Publisher : 王子昀
【Other】 insert DL : 0: 插入排序：包括直接插入排序，希尔插入排序。直接插入排序：将一个记录插入到已经排序好的有序表中。 1, sorted数组的第0个位置没有放数据。 2，从sorted第二个数据开始处理：如果该数据比它前面的数据要小，说明该数据要往前面移动。首先将该数据备份放到 sorted的第0位置当哨兵。然后将该数据前面那个数据后移。然后往前搜索，找插入位置。找到插入位置之后讲第0位置的那个数据插入对应位置。 O(n*n), 当待排记录序列为正序时，时间复杂度提高至O(n)。希尔排序（缩小增量排序 diminishing increment sort）：先将整个待排记录序列分割成若干个子序列分别进行直接插入排序，待整个序列中的记录基本有序时，再对全体记录进行一次直接插入排序。-Insertion Sort: Including direct insertion sort, Hill insertion sort. Direct insertion sort: a record inserted into the already sorted the good and orderly table. 1 0th position in the sorted array is not the playback data. 2, starting from the sorted data processing: If the data to be smaller than its preceding data, Description the data to Wang Qianmian mobile. First backup the data sorted into the 0 position when the sentry. The data in front of the data after the shift. Then forward search to find the insertion position. Find the insertion position stresses that the 0 position data into the corresponding position. O (n* n), to be ranked record a sequence of positive sequence, the time complexity up to O (n). Hill sorting (narrow incremental sort of diminishing increment sort): to be ranked first copy the entire record sequence is divided into a number of sub-sequences,
Update : 2024-05-08 Size : 1024 Publisher : 陈锋
【Other】 XS128-simple-system DL : 0: 龙丘XS128开发板的一些小程序，源代码-Long Hill XS128 development board some small programs, the source code
Update : 2024-05-08 Size : 2003968 Publisher : elena123
【Other】 McGraw.Hill.MATLAB.Demystified.Apr.2007 DL : 0: matlab book for beginners
Update : 2024-05-08 Size : 2241536 Publisher : marte
【Other】 ShellSort DL : 0: 希尔排序的改良版希尔排序的改良版 -Sort improved version of Hill sort of modified version of the Hill Hill sort modified version of the improved version of the Hill sorting
Update : 2024-05-08 Size : 1024 Publisher : 李国栋
【AI-NN-PR】 Algorithm-1 DL : 0: 利用登山算法生成大围长的QC-LDPC码-Use hill-climbing algorithm to construct QC-LDPC code
Update : 2024-05-08 Size : 110592 Publisher : lirui
【CSharp】 Sorting-algorithm DL : 0: 本文件包含常见经典排序算法如希尔排序、二分插入法、直接插入法、带哨兵的直接排序法、冒泡排序、选择排序、快速排序、堆排序。 -This file contains the common classical scheduling algorithms such as Hill sort, two insertion method, direct insertion method, the direct sequencing method with sentinel, bubble sort, selection sort, quick sort, heap sort。
Update : 2024-05-08 Size : 8192 Publisher : 李峰
【Other】 McGraw-Hill-Principles-and-applications-of-Electr DL : 0: Electrical engineer e-book
Update : 2024-05-08 Size : 7616512 Publisher : conver
【Data structs】 rand DL : 0: C++ 将产生的随机数存入文件中，使用冒泡、快速、归并、希尔排序并计算排序时间，将排序时间存入excel中-The random number C++ will be stored in the file, using the bubble, quick, merge, Hill sort and calculate the sorting time, sorting time in Excel
Update : 2024-05-08 Size : 1276928 Publisher : 陈晓冰
【matlab】 mine DL : 0: Solving Travel Salesman Problem using Hill Climbing algorithm >> using 30 cities.
Update : 2024-05-08 Size : 1024 Publisher : Ali
【Data structs】 Sorts DL : 0: 排序算法，插入排序，折半排序，快速排序，希尔排序-Sorting algorithm, insertion sort, binary sort, quick sort, Hill sorting
Update : 2024-05-08 Size : 13312 Publisher : 蓝月
【CSharp】 Algorithm DL : 0: 用C#实现数据结构的各种排序功能,包括选择排序,快速排序,希尔排序,二分法排序,二叉排序树等-C# data structure to achieve the various sorting functions, including selection sort, quick sort, Hill sorting, sort of dichotomy, binary sort tree
Update : 2024-05-08 Size : 230400 Publisher : fdghdhg
【Other】 UMAT-HILL48 DL : 9: abaqus调用子程序umat关于hill屈服准则的程序，保密文件-abaqus procedure about umat
Update : 2024-05-08 Size : 4096 Publisher : 赵海
【Software Engineering】 the-mythical-man-mouth DL : 0: 人月神话的作者Frederick P. Brooks，Jr.是北卡罗来纳大学Kenan-Flagler商学院的计算机科学教授，北卡来罗来纳大学位于美国北卡来罗来纳州的查布尔希尔。Brooks被认为是“IBM 360系统之父”，他担任了360系统的项目经理，以及360操作系统项目设计阶段的经理。凭借在上述项目的杰出贡献，他、Bob Evans和Erich Bloch在1985年荣获了美国国家技术奖（National Medal of Techology）。早期，Brooks曾担任IBM Stretch和Harvest计算机的体系结构师-Frederick P. Brooks, Jr. Was University of North Carolina Kenan-Flagler Business School, Professor of Computer Science, North Carolina to Romania Carolina University is located in North Carolina to Romania Carolina Chapel Hill. Brooks is considered the "IBM 360 system" Father, he served as project manager for 360 systems, as well as 360 operating system design phase of the project manager. With outstanding contribution in these projects, he, Bob Evans and Erich Bloch in 1985 was awarded the National Medal of Technology (National Medal of Techology). Early, Brooks served as IBM Stretch and architecture of the computer division Harvest
Update : 2024-05-08 Size : 1148928 Publisher : john
【SCM】 LQ-845xjiaoduhuoqu DL : 0: 用c语言实现龙丘倾角传感器的的倾角获取，从而控制被控对象的平衡-C language Long Hill inclination angle sensor acquisition, thereby controlling the balance of the controlled object
Update : 2024-05-08 Size : 2048 Publisher : zhugege
【Data structs】 paixu DL : 0: 利用随机函数产生N个随机整数（20000以上），对这些数进行多种方法进行排序。（1）至少采用三种方法（希尔排序、快速排序、堆排序）实现上述问题求解；（2）统计每一种排序方法的性能（以上机运行程序所花费的时间为准进行对比），找出其中两种较快的方法；（3）统计每种算法所用的比较次数和交换次数，最后列表显示； -Using the random function random integers N (20,000 or more), the number of these various methods for sorting. (A) at least three methods (Hill sort, quick sort, heap sort) to achieve the above-mentioned problem solving (2) statistical performance of each sort method (above machine running the program based on the time it takes to compare), identify two of the faster method (3) statistical comparison of each algorithm used in the frequency and the number of exchanges, the final list display
Update : 2024-05-08 Size : 2048 Publisher : 苏中华
【Software Engineering】 Source_and_Demo DL : 0: Path Finding solutions with Deep-First, Hill Climbing, Genetic algorithm, etc
Update : 2024-05-08 Size : 96256 Publisher : scarsms

« 1 2 ... 37 38 39 40 41 4243 44 45 46 47 ... 50 »