Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 1,521 papers for “Merge sort”

MERGE SORT

2013

roughly equal size. If subprogram can be solved independently, there is a possibility of significant speed up by parallel computing. The DC paradigm has been used widely to design a number of efficient algorithms for broad scientific and engineering applications. Examples include a hierarchy of particle simulation methods, in which spatially localized subproblems are solved in a global embedding field, which is efficiently computed with tree-based algorithms (see Figure). Examples of the embedding field are the electrostatic field in molecular dynamics (MD) simulations 1 and the self-consistent Kohn-Sham potential in quantum mechanical (QM) simulations in the framework of the density functional theory (DFT). 2 Figure. Schematic of a divide-and-conquer (DC) particle simulation algorithm. (Left) The physical space is subdivided into spatially localized cells, with local particles constituting subproblems (bottom), which are embedded in a global field (shaded) solved with a tree-based algorithm. (Right) To solve the subproblem in domain Ω α in the DC-DFT algorithm, coarse multigrids (gray) are used to accelerate iterative solutions on the original real-space grid (corresponding to the grid refinement level, l = 3). The bottom panel shows fine grids adaptively generated near the atoms (spheres) to accurately operate the ionic pseudopotentials on the electronic wave functions. In the following, we use the sorting problem as an example to practice the programming of parallel divide-and-conquer algorithms and examine their communication patterns.

Cited by 0

Merge Sort

Michael McCool, Arch D. Robison, James Reinders · Elsevier eBooks · 2012

Cited by 1

Lazy Merge Sort: An Improvement over Merge Sort

Sachin Pandey, Anika Gupta · 2024

Arrangement of elements in a dataset often forms a crucial aspect in determining the overall performance of the underlying algorithms. Elements arranged in sorted order, either ascending or descending, may serve as an additional benefit for many other algorithms to work upon efficiently. Many algorithms exist in the literature for sorting of the data. The algorithms have wide range of applicability depending on their distinctive properties. However, O(nlogn) algorithms are frequently used in most of the real-world languages and applications. This research aims to further optimize the already existing Merge Sort. It proposes a modified approach named as Lazy Merge Sort that works on the principle of deferred merging until the last step by creating in-between sorted sub-arrays. The proposed approach is further validated and analysed over O(nlogn) baseline algorithms. During the experimentation and validation phase, the proposed Lazy Merge Sort performed better as well as proved to be efficient with respect to other baseline algorithms. The average and worst time complexity for the proposed algorithm is O(nlogn) and traditional Merge Sort serves as an upper bound for it. It offers a competitive alternative to conventional methods and contributes significantly to sorting algorithms in Computer Science.

Cited by 4

Sort-Merge Join

Jingren Zhou · Encyclopedia of Database Systems · 2009

Cited by 1

Merge Sort Algorithm

Akash Kumar, Akshay Dutt, Gautam Saini et al. · 2016

Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms such as the Bubble, Insertion and Selection Sort all have a quadratic time complexity that limits their use when the number of elements is very big. In this paper, we introduce Merge Sort, a divide-and overcome algorithm to sort an N element array. We evaluate the O(NlogN)time complexity of merge sort theoretically and empirically. Our results show a large improvement in efficiency over other algorithms.

Cited by 0

Sort, merge, repeat

Aaron Wolin, B. Paulson, Tracy Hammond · 2009

Free-sketch recognition systems attempt to recognize freely-drawn sketches without placing stylistic constraints on the users. Such systems often recognize shapes by using geometric primitives that describe the shape's appearance rather than how it was drawn. A free-sketch recognition system necessarily allows users to draw several primitives using a single stroke. Corner finding, or vertex detection, is used to segment these strokes into their underlying primitives (lines and arcs), which in turn can be passed to the geometric recognizers. In this paper, we present a new multi-pass corner finding algorithm called MergeCF that is based on continually merging smaller stroke segments with similar, larger stroke segments in order to eliminate false positive corners. We compare MergeCF to two benchmark corner finders with substantial improvements in corner detection.

Cited by 15

Non-Partitioning Merge-Sort

Asra Aslam, Mohd. Samar Ansari, Shikha Varshney · 2016

The importance of a high performance sorting algorithm with low time complexity cannot be over stated. Several benchmark algorithms viz. Bubble Sort, Insertion Sort, Quick Sort, and Merge Sort, etc. have tried to achieve these goals, but with limited success in some scenarios. Newer algorithms like Shell Sort, Bucket Sort, Counting Sort, etc. have their own limitations in terms of category/nature of elements which they can process. The present paper is an attempt to enhance performance of the standard Merge-Sort algorithm by eliminating the partitioning complexity component, thereby resulting in smaller computation times. Both subjective and numerical comparisons are drawn with existing algorithms in terms of time complexity and data sizes, which show the superiority of the proposed algorithm.

Cited by 0

Min Max Merge Sort

Abbas Mubarak · Data Archiving and Networked Services (DANS) · 2023

Min max merge source code

Cited by 0Open access

Halstead’s Complexity Measure of a Merge sort and Modified Merge sort Algorithms

Ghaniyyat Bolanle Balogun, Muhideen Abdulraheem, Peter O. Sadiku et al. · Jambura Journal of Informatics · 2023

Complexity measuring tools in computer science are deployed to measure and compare different characteristics of algorithms in order to find the best one in solving a particular problem or that suits a particular situation. In view of this, Halstead’s complexity metrics is deployed to compare the efficiency of two external sorting methods; the Merge sort and the Modified Merge sort algorithms. The methodology used in achieving this, lies in the extraction of operators and operands from the C_sharp (C#) implemented program of the two algorithms. Six Halstead metrics are evaluated using these operators and operands as parameters. The results shows that the Modified Merge sort algorithm is much more efficient than the conventional Merge sort as it has a lower Program Volume, lower Program difficulty and a lower Program Effort even though the advantage of a higher Intelligence content goes to the Merge sort algorithm.

Cited by 0Open access

A smooth applicative merge sort

O'Keefe, R., Edinburgh Univ. (UK). Dept. of Artificial Intelligence · OpenGrey (Institut de l'Information Scientifique et Technique) · 1982

Cited by 0