Facilitate External Sorting for Large-Scale Storage on Shingled Magnetic Recording Drives
0
Citation
4
Reference
10
Related Paper
Keywords:
Merge (version control)
Auxiliary memory
In this paper,the Sorting in the calculator program design of importance is discussed,and the new methods of two kinds of sort and the c language realization of the calculate ways are given.
Calculator
Realization (probability)
Cite
Citations (0)
This Paper proposes an efficient Quick Sort algorithm for sorting a large array. Quick Sort has proved to be the fastest sorting algorithm used for sorting, making O (n log n) comparisons to sort n items. The proposed algorithm is based on a dynamic pivot selection to enhance the average case and eliminate the worst case behavior of the original Quick Sort. The suggested QSort is data-dependent to increase the chances of splitting the array into relatively equal sizes. The algorithm is smart enough to recognize a sorted array that doesn’t require further processing.
Cite
Citations (1)
Sorting is one of a classic problem in computer engineer. One well-known sorting algorithm is a Counting Sort algorithm. Counting Sort had one problem, it can’t sort a positive and negative number in the same input list. Then, Modified Counting Sort created to solve that’s problem. The algorithm will split the numbers before the sorting process begin. This paper will tell another modification of this algorithm. The algorithm called Parallel Counting Sort. Parallel Counting Sort able to increase the execution time about 70% from Modified Counting Sort, especially in a big dataset (around 1000 and 10.000 numbers).
Counting problem
Cite
Citations (1)
Cite
Citations (2)
This paper presents a systematic approach for designing a C++ app for demonstrating sorting algorithms on smartphones and tablets. It is part of an on-going project on the usages of new technologies in education. The general properties of mobile platforms are discussed together with details specific to demonstrating sorting algorithms. The implementation of Insertion Sort is given as an example. The obtained results (e.g. design rules and algorithms) have been tested within a prototype application.
Mobile apps
Cite
Citations (5)
The Super Sort Sorting algorithm is a sorting algorithm that uses forward selection, backward selection, merging, and partition to sort a given list or data set. This study will focus on the enhancement of the Super Sort Sorting Algorithm on the forward selection part. This paper introduces an enhanced version of the algorithm where the concept of Identical Value Search was implemented on the first forward pass. This method eliminated the small sublists left behind by the original algorithm's forward pass and reduced the overall runtime of the algorithm.
Selection algorithm
Merge sort
Value (mathematics)
Cite
Citations (0)
Quick sort is a commonly used sorting method,and the average performance is relatively good in all internal sorting methods,but if the choice of base element is not good,it may become slow,and in the worst case,time complexity is O(n2).This paper designs an algorithm by using all the elements of keywords to be ranked as a benchmark mean sort,which greatly increases the speed of sorting and effectively avoid theslowphenomenon..
Benchmark (surveying)
Cite
Citations (0)
In this paper, we present the work regarding the selection sorting technique for double ended selection sort. This sorting algorithm is both theoretical and programmatically analysis show that the introduce advance selection sort algorithm which enhances the performance of selection sort. It is much faster than the selection sort because of its selection of minimum and maximum elements simultaneously. Advance selection sort algorithm possibility of enhancing execution speed up to 30%. Code for this algorithm is written in C programming Language. So easy to understand the concept of this sorting algorithm by everyone because C is the popular language. Results and discusion show a higher level of performance for the sorting algorithm. It can theoretically prove that the algorithm can reduce steps with the selection short and will improve N2 sorts toward NlogN sort.
Merge sort
Selection algorithm
Code (set theory)
Cite
Citations (0)
Sorting is an important operation in computer programming,and it also plays an extremely important position in data processing.There are a variety of sorting,selection method is one of the more simple and effective algorithm.This paper discusses the selection sort algorithm with the C language implementation of the three methods,and the three methods in key exchange number of times and times of comparison are analyzed and compared.
Cite
Citations (0)