Search
4 articles for “merge sort”
-
Forest Sort: Implementation and Performance Analysis
Abstract: A new technique has been introduced for sorting a large number of data set. Technique is known as Forest sort. It comprises of 3 steps- (1) a forest of binary trees has been made using hashing (2) In order traversal of each tree has been carried out concurrently (3) Merge sort has been applied to the resulting lists in (2) in a concurrent manner. A comparison has also been made …
Published in Research & Reviews: A Journal of Embedded System & Applications · Vol. 1, Issue 1, 2013 · pp. 19–23 Read article
-
Sorting
Abstract: Our research paper aims at sorting. Sorting is any process of arranging items according to a certain sequence or in different sets. It is a term that is used to sort the data in ascending or descending order. In this paper, we will discuss about internal and external sorting, and also about some terminologies in this, like: insertion sort, merge sort, quick short, heap short, bubble sort, radix sort and …
Published in Recent Trends in Programming languages · Vol. 3, Issue 2, 2016 · pp. 4–6 Read article
-
Dynamic Data Flow Based Spatial Sorting Method for GPUs: Software Based Autonomous Parallelization
Abstract: The direct communication between distant parts of a computer system for a mesh or grid based scalable parallel system isn't cost effective. Thus, we have presented and evaluated the performances of spatial sorting method for multi-core GPUs (Graphic Processing Unit) computing. It is a parallel sorting algorithm for autonomous threading of workload which is considerably faster than Thrust Merge sorting, which is known to be the best comparison based sorting …
Published in Recent Trends in Parallel Computing · Vol. 1, Issue 2, 2014 · pp. 11–14 Read article
-
Comprehensive Analysis of Counting by Sorting
Abstract: Sorting algorithms play an important role in computer science, as they facilitate the effective organization and retrieval of data. Counting sort is a non-comparative integer sorting algorithm that works well with a limited number of integers known beforehand. The process, advantages, and limitations of this sorting algorithm were investigated in this study. Unlike other comparison-based sorting algorithms, counting sort achieves a time complexity of O(n+k), which depends on the input …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 11, Issue 2, 2024 · pp. 1–6 Read article