Back to Search
Start Over
Enhanced Merge Sort- A New Approach to the Merging Process
- Source :
- Procedia Computer Science. :982-987
- Publisher :
- The Author(s). Published by Elsevier B.V.
-
Abstract
- One of the major fundamental issues of Computer Science is arrangement of elements in the database. The efficiency of the sorting algorithms is to optimize the importance of other sorting algorithms11. The optimality of these sorting algorithms is judged while calculating their time and space complexities12. The idea behind this paper is to modify the conventional Merge Sort Algorithm and to present a new method with reduced execution time. The newly proposed algorithm is faster than the conventional Merge Sort algorithm having a time complexity of O(n log2 n). The proposed algorithm has been tested, implemented, compared and the experimental results are promising.
- Subjects :
- Proxmap sort
Internal Sorting
Sorting algorithm
Selection sort
Comparison sort
Computer science
Recursive
02 engineering and technology
Parallel computing
External sorting
01 natural sciences
Internal sort
External Sorting
Iterative
Adaptive sort
0103 physical sciences
Integer sorting
0202 electrical engineering, electronic engineering, information engineering
In-place algorithm
Data_FILES
Merge sort
Timsort
Divide and Conquer
Time complexity
Block sort
General Environmental Science
Insertion sort
Stooge sort
010308 nuclear & particles physics
Sorting
stack
Hybrid algorithm
Merge Sort
Polyphase merge sort
Merge algorithm
General Earth and Planetary Sciences
020201 artificial intelligence & image processing
Bucket sort
Pigeonhole sort
Algorithm
Counting sort
Subjects
Details
- Language :
- English
- ISSN :
- 18770509
- Database :
- OpenAIRE
- Journal :
- Procedia Computer Science
- Accession number :
- edsair.doi.dedup.....df345e9d970cf9c5ddecdb84319b61c6
- Full Text :
- https://doi.org/10.1016/j.procs.2016.07.292