检索结果-内蒙古大学图书馆

2016 3rd International Conference on Economic,Business Management and Education Innovation(EBMEI 2016)

作者： Bin Yang Wei Zhang Caixia Liu School of Information Science and Engineering Zaozhuang University

sort algorithm is a very important application algorithm. The understanding and mastery of this algorithm is of great help for the future research and work of undergraduate students. However,in reality, understanding of these algorithms is not accurate, and the students could not grasp the idea of the algorithms. In this paper, based on the needs of the construction of Application University, we design a teaching flowchart for the sort algorithm, which has a guiding role for students.

关键词： Data structure sort algorithm Teaching method Application

来源：评论

学校读者我要写书评

暂无评论

Overview of the study on bubble sort algorithm

引用

International Journal of Advancements in Computing Technology 2011年第5期3卷 1-7页

作者： Fuguo, Dong Lan, Wu Da, Yuan School of computer science and technology Shandong Institute of Business and Technology Shandong YanTai China Department of computer science HeTao University Nei Menggu 015000 China

Bubble sort algorithm and its variants are discussed in detail. Bubble sort algorithm is the slowest one in application;improved bubble sort algorithm is superior to it because of the introduction of flag variant and the forward movement of end index;improved bubble sort algorithm moves the end index more quickly;bidirectional bubble sort algorithm quickly moves the end index forwards and the start index backwards at the same time. In all these algorithms, bidirectional bubble sort algorithm is especially suitable to those sequence parts items of which are already in expected order. Bidirectional bubble sort algorithm is of great significance and has the highest efficiency.

关键词： algorithm design and analysis Bidirectional bubble sort algorithm

来源：评论

学校读者我要写书评

暂无评论

sortIA 2.0: A sorting game for data structure teaching 2016

SORTIA 2.0: A sorting game for data structure teaching

引用

Proceedings of the XII Brazilian Symposium on Information Systems on Brazilian Symposium on Information Systems: Information Systems in the Cloud Computing Era - Volume 1

作者： Paulo E. Battistella Giani Petri Christiane G.V. Wangenheim Aldo V. Wangenheim Jean E. Martina Universidade Federal de Santa Catarina

ISBN: (纸本)9788576693178

The teach of sorting algorithms in data structure discipline of Computer courses, typically is accomplished through lectures and implementation of algorithms by students. With the aim of support the teaching algorithms, this paper presents the sortIA 2.0 game, which aims to teach the Heapsort sorting algorithm through simulation of its execution. It is an online game, single player and free. To evaluate the game we used the model for assessment educational game MEEGA. The evaluation involved 25 students of the discipline of data structure of Computer Science course, of the Federal University of Santa Catarina (UFSC).The results of this first evaluation show that students felt satisfied, confident, immersed and have fun with the game, but principally consider that it really contributes to learning the discipline and also professionally.

关键词： Game Design sort algorithm Game Based Learning Education

来源：评论

学校读者我要写书评

暂无评论

Parallel Genetic algorithm for Creation of sort algorithms

Parallel Genetic Algorithm for Creation of Sort Algorithms

引用

5th International Conference on Computational Collective Intelligence (ICCCI)

作者： Trajkovski, Igor Ss Cyril & Methodius Univ Skopje Fac Comp Sci & Engn Skopje 1000 North Macedonia

ISBN: (纸本)9783642404955;9783642404948

In this paper we present parallel genetic algorithm that was used to the task of evolving imperative sort programs. A variety of interesting lessons were learned. With proper selection of the primitives, sorting programs were evolved that are both general and non-trivial. Unique aspect of our approach is that we represent the individual programs with simple assembler code, rather than usual tree like structure. We also report the effect of different parameters on quality of the programs and time needed for finding the solution.

关键词： genetic algorithm sort algorithm parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

Generating a Novel sort algorithm using Reinforcement Programming

Generating a Novel Sort Algorithm using Reinforcement Progra...

引用

2010 IEEE World Congress on Computational Intelligence

作者： White, Spencer K. Martinez, Tony Rudolph, George Brigham Young Univ Dept Comp Sci Provo UT 84602 USA The Citadel Dept Math & Comp Sci Charleston SC 29409 USA

ISBN: (纸本)9781424481262

Reinforcement Programming (RP) is a new approach to automatically generating algorithms, that uses reinforcement learning techniques. This paper describes the RP approach and gives results of experiments using RP to generate a generalized, in-place, iterative sort algorithm. The RP approach improves on earlier results that that use genetic programming (GP). The resulting algorithm is a novel algorithm that is more efficient than comparable sorting routines. RP learns the sort in fewer iterations than GP and with fewer resources. Results establish interesting empirical bounds on learning the sort algorithm: A list of size 4 is sufficient to learn the generalized sort algorithm. The training set only requires one element and learning took less than 200,000 iterations. RP has also been used to generate three binary addition algorithms: a full adder, a binary incrementer, and a binary adder.

关键词： automatically generating algorithms binary incrementer full adder genetic algorithms genetic programming iterative methods iterative sort algorithm learning (artificial intelligence) reinforcement programming sort algorithm sorting

来源：评论

学校读者我要写书评

暂无评论

A Quick sorting algorithm Adaptive to Massive Data with High Repetition Rate

A Quick Sorting Algorithm Adaptive to Massive Data with High...

引用

3rd International Conference on Materials and Products Manufacturing Technology (ICMPMT 2013)

作者： Chen, Baoping NeiMongol Univ Finance & Econ Dept Comp Informat & Management Hohhot 010070 Peoples R China

ISBN: (纸本)9783037859162

Quick sorting is one of the sorting algorithms with good performance. However, there is a bottleneck of its performance in dealing with massive data with high repetition rate. Therefore, a new effective quick sorting algorithm is proposed in this study. This approach possesses the advantage of conciseness of quick sorting algorithms while avoiding the disadvantages of recursive algorithms. The time complexity is O(n), and the space complexity is O(1). Theoretical analysis and experimental data have shown that its performance is superior to the original quick sorting algorithm, and it is applicable to the processing of massive data with high repetition rate.

关键词： sort algorithm high efficiency quick sort complexity

来源：评论

学校读者我要写书评

暂无评论

A Cooperative sort algorithm Based on Indexing

A Cooperative Sort Algorithm Based on Indexing

引用

13th International Conference on Computer Supported Cooperative Work in Design

作者： Zheng, Guigang Teng, Shaohua Zhang, Wei Fu, Xiufen Guangdong Univ Technol Fac Comp Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781424435340

Based on insertion, Quick-sort and Merge-sort algorithms, this paper proposes an improved method about indexing and presents its corresponding parallel algorithm. Introduction of index table increases memory consumption but decreases consumption of record movement in sorting. The experiment demonstrates that executing CPU time of indexing-based sort algorithm is evidently less than that of other sort algorithms. Based on index table and parallel computing, the Merge-sort algorithm saved the waiting and disposal time in which every two sub-merging sequences are sorted in single processor computer. This obtained better efficiency than the original Merge-sort algorithm.

关键词： sort algorithm Parallel Computing Merge-sort Index Table Time Efficiency

来源：评论

学校读者我要写书评

暂无评论

3-D RAY Tracing Method Based on Graphic Structure

引用

Chinese Journal of Geophysics 2013年第4期43卷 568-575页

作者： Hui WANG Xu CHANG Beijing University of Science and Technology Beijing 100083 China Institute of Geology and Geophysics Chinese Academy of Sciences Beijing 100101 China

The shortest ray path method based on graphic structure overcomes the drawbacks and limitations of traditional ray-tracing methods, but the computation time and accuracy of the results need to be improved. This paper introduces Bresenham line algorithm into the traveltime calculating of nodes to improve the accuracy of traveltime and ray path results. To speed up computation, it uses Quicksort algorithm and Insertion sort algorithm instead of usually used Heapsort algorithm. We take advantage of the node configuration presented in this paper to introduce the velocity interface, and accordingly get the algorithm of reflection ray tracing .Numerical tests proved that it is an flexible and efficient ray tracing method.

关键词： Ray tracing Shortest ray path Line algorithm sort algorithm Velocity interface

来源：评论

学校读者我要写书评

暂无评论

An Efficient Parallel sorting algorithm on Metacube Multiprocessors

引用

9th International Conference on algorithms and Architectures for Parallel Processing

作者： Li, Yamin Peng, Shietung Chu, Wanming Hosei Univ Dept Comp Sci Tokyo 1848584 Japan Univ Aizu Dept Comp Hardware Aizu Wakamatsu Fukushima 9658580 Japan

ISBN: (纸本)9783642030949

Parallel sorting algorithms in hypercubes have been studied extensively. One of the practical parallel sorting algorithms is Bitonic sort, which is implemented in O(n(2)) time for sorting N = 2(n) numbers in an n-cube. A versatile family of interconnection networks alternative to hypercube, called metacube, was proposed for building extremely large scale multiprocessor systems with a small number of links per node. A metacube MC(k, m) connects 2(2km+k) nodes with only k + m links per node. In this paper, we present an efficient sorting algorithm on metacube multiprocessors. The proposed sorting algorithm is based on the Batcher's bitonic sorting algorithm. In order to perform the parallel sorting efficiently in metacube, we give a new presentation of the metacube such that the communications required by the algorithm can be done efficiently with gather and scatter operations. The parallel bitonic sort algorithm implemented in metacubes with the new presentation runs in O(2m(k) + k)(2) computation steps and O(2(m)(k)(2k + 1) + k)(2) communication steps.

关键词： Parallel algorithm sort algorithm hypercube metacube

来源：评论

学校读者我要写书评

暂无评论

快速外分类算法设计与分析

引用

郑州大学学报（理学版） 1987年第2期28卷 26-30,57页

作者：何文趋

§1 引言数据库文件的分类是数据处理的重要课题之一,它直接影响数据库的检索效率。目前外分类算法中多数采用分类归并方法[1][2],分类归并过程一般先逐段执行内分类,每次读入内存缓冲区所能容纳的数据,选择一内分类算法将数据整理... 详细信息

§1 引言数据库文件的分类是数据处理的重要课题之一,它直接影响数据库的检索效率。目前外分类算法中多数采用分类归并方法[1][2],分类归并过程一般先逐段执行内分类,每次读入内存缓冲区所能容纳的数据,选择一内分类算法将数据整理成有序串,并根据归并的散布算法输出这些有序串,然后数据在内外存间进行归并,以形成一个最终的有序串。

关键词： sort algorithm quick sort time complexity.

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：