助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   归并排序 在 计算机软件及计算机应用 分类中 的翻译结果: 查询用时:0.033秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
数学
更多类别查询

图标索引 历史查询
 

归并排序     
相关语句
  merge sorting
    A fast parallel merge sorting algorithm based on LARPBS model
    基于LARPBS模型的快速并行归并排序算法
短句来源
    In this paper a fast parallel merge sorting algorithm based on LARPBS is presented. This method uses M~(1+ε)(0<ε<1) processors to merge the M~ε() sorted sequence in O(lb()lb()M) time.
    提出了一种基于LARPBS模型上的并行归并排序算法,该算法使用M1+ε(0<ε<1)个处理器可以在O(lb lbM)时间内对Mε个有序序列进行归并.
短句来源
    In this paper a fast parallel merge sorting algorithm based on LARPBS is presented. With this algorithm,we can use N~(1+■)(0<■<1) processors to sort N elements in O((loglogN)~2) time.
    文章提出了一种LARPBS模型上的并行归并排序算法,利用该算法对长度为N的序列进行排序,使用N~(1+)着(0<着<1)个处理机可以在O((loglogN)~2)时间完成。
短句来源
    A Valiant Parallel Merge Sorting Algorithm Based on Reconfigurable Optical Pipeline Bus
    基于流水光总线阵列上Valiant并行归并排序的实现
短句来源
    A Parallel Merge Sorting Algorithm for Reconfigurable Computational Models Based on Wide-Bandwidth Bus Networks
    带有宽总线网络的可重构计算模型上的并行归并排序算法
短句来源
更多       
  merging sorting
    A Parallel Merging Sorting Algorithm for Hypercube Architecture
    超立方体结构上的并行归并排序算法
短句来源
    THE ARRAY MAPPING OF A MERGING SORTING ALGORITHM
    一种归并排序算法的阵列映射
短句来源
    AN EFFICIENT MULTIWAY MERGING SORTING NETWORK
    一种新的多路归并排序网络
短句来源
    The theory about a merging sorting algorithm-insert merging is presented in this paper. Through the mapping it into systolic array, the realizing method of VLSI array by canonical mapping is proposed focuses.
    本文介绍一种归并排序算法—插入归并算法的基本原理,并通过该算法的Systolic阵列映射,重点阐述了正则映射生成VLSI阵列的理论和方法。
短句来源
    It computes the positions of the first and last elements in merging pair,and then makes merging sorting from those positions.
    算法充分利用并行系统中各个处理机中数据排序后序列长度相等的特点,计算出归并段对中的一个元素和最后一个元素的位置,然后再从相应的位置进行归并排序
短句来源
更多       
  merge-sort
    Later we explore the newly algorithms of temporal aggregation, which are aggregation tree algorithm, k-ordered aggregation tree algorithm, 2-3 tree algorithm, balanced tree algorithm and merge-sort aggregation algorithm.
    综述了聚集树算法、k级有序聚集树算法、2-3树算法、平衡树算法以及归并排序聚集算法等时态聚集算法。
短句来源
    The Algorithm of Bitonic Merge-Sort
    二分归并排序算法
短句来源
    This paper considers SQL Group-By and aggregation based on merge-sort in parallel database systems.
    本文考虑在并行数据库系统中基于归并排序的分组操作和集函数计算。
短句来源
  merging sort
    This paper presents a new sorting method, the new merging sort algorithm by mapping, which consists of mapping, linking and merging. Its algorithm description, time complexity and experimental results in C are given.
    将链接技术引入归并排序 ,提出了一种以链接技术和归并算法为基础的新排序算法—链接归并排序算法 (以下简称为“链接归并排序”) ,给出了该排序算法的描述、时间复杂度分析及用C语言编写程序进行算法比较的实验结果 .
短句来源
    The Merging Sort Algorithm by Linking
    一种新的链接归并排序算法
短句来源
    The New Merging Sort Algorithm by Mapping
    任意分布数据的映射归并排序算法研究
短句来源
    The method is obviously better than those of Flash Sort、Proportion Split Sort、2 Course Merging Sort and Straight K Course Merging Sort in dealing with the sorting problem of large scale gathering.
    而且在处理上述大规模“汇总”排序问题时 ,映射归并排序速度明显优于FlashSort、ProportionSplitSort、2 路重复的K路归并排序和直接K路归并排序等算法 .
短句来源
    Then the efficiency of the insertion sort and merging sort algorithms are analyzed by means of entropy, and it is pointed out that when the length of the series is larger than 4, any sorting algorithm based on direct comparison requires more comparisons than the lower bound.
    然后利用信息熵原理分析了插入排序和归并排序的效率 ,指出当序列长度大于 4时 ,任何直接插入排序的比较次数大于理论下界 .
短句来源
更多       

 

查询“归并排序”译词为其他词的双语例句

 

查询“归并排序”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  merge sorting
This algorithm is similar to the parallel odd-even merge sorting algorithm proposed by Batcher, except in the latter, the basic operation sorts only two elements.
      
  merge-sort
To quickly combine them together, we used the merge-sort algorithm.
      
This sorting is done in external memory by using a multiway merge-sort algorithm.
      
This is a merge-sort based scheme, where the merge step is performed by reordering a bitonic sequence.
      
Then this merging process can easily be done in linear time using a merge-sort-like algorithm.
      
We assume the merge-sort algorithm is applied, where the number of merge passes depends on the amount of main memory available.
      
  其他


点击这里查询相关文摘
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关归并排序的内容
在知识搜索中查有关归并排序的内容
在数字搜索中查有关归并排序的内容
在概念知识元中查有关归并排序的内容
在学术趋势中查有关归并排序的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社