رویکرد جدید در الگوریتم مرتب سازی
Abstract
1-Introduction
2-Overview of Sorting Algorithms
3-Related Study
4-MinFinder Sorting Algorithm
5-Results and Analysis
6-Conclusion and Future Works
References
Abstract
Sorting a set of unsorted items is a task that happens in computer programming while a computer program has to follow a sequence of precise directions to accomplish that task. In order to find things quickly by making extreme values easy to see, sorting algorithm refers to specifying a technique to arrange the data in a particular order or format where maximum of communal orders is in arithmetic or lexicographical order. A lot of sorting algorithms has already been developed and these algorithms have enhanced the performance in the factors including time and space complexity, stability, correctness, definiteness, finiteness, effectiveness, etc. A new approach has been proposed in this paper in sorting algorithm called MinFinder to overcome some of the downsides and performs better compared to some conventional algorithms in terms of stability, computational time, complexity analysis.
Introduction
The most used application of sorting algorithms includes forming or displaying items by their price on different ecommerce websites (e.g. amazon, eBay, etc.), defining the order of sites by alphanumeric order on a search engine results page [1]. The importance of sorting is to search data can be improved while data is kept in a sorted way. There are two types of sorting: (i) internal sorting where the number of items is small enough to fits into the main memory, and (ii) external sorting where the number of items is so large that some of them reside on external storage during the sort. In this paper, we consider several internal sorting algorithms (e.g. Bucket sort, Bubble sort, Insertion sort, Selection sort, Heap sort, Merge sort) [2] in conjunction with some of the optimized algorithms (e.g. Parallel Shell sort, Parallel Quicksort, Parallel and Multithreading Merge sort, etc.) [3]-[7]. In this paper, we propose a new approach for sorting a list of items in simple way (highest-to-lowest value) without using conventional swapping concept that would consume memory. We also try to reduce the computational time that uses only one looping control structure ‘for loop’ in conjunction with branching control structure ‘goto’ that causes the logic to jump to a specific place in the program to reuse. This proposed sorting algorithm will try to overcome some basic drawbacks of conventional sorting algorithms.