Position Sort
نویسندگان
چکیده
Computer science has many important concepts which are used at a very large scale. It is frequently used by the real life and system applications. Sorting is one of the most important concepts in computer science. Through this paper, we are present a new concept of sorting named "Position Sort" which improves the sorting algorithm by reducing the swapping operation, which directly effects and improve the running time of algorithm. We solve the problem of sorting by various methods. Some methods are very complex to implement. The concept of position sort is very efficient and easy to implement. It increases the efficiency of problem by reducing the swapping operations. This algorithm uses the basic idea of sorting and produces the result. It places an element at their right position by a single swapping only.
منابع مشابه
The Position of Tribe and Urban Structure in Social Compatibility of Sham and Iraq in Umayyad Era
The Arabic-Islamic Umayyad state, as the first Islamic dynasty, managed to have the monopoly of tribal discourse in Islamic world in 40 AH through conquering the already dominant religious theocracy discourse. Umayyad caliphs succeeded in conquering the occidental world to Andalusia and the oriental world to middle Asia by the help of creating a sort of social solidarity. These conquests took p...
متن کاملGRS - GPU radix sort for multifield records
We extend the number sorting algorithms on the GPU to sort large multi-field records. We notice that traditional way of sorting the records by first sorting a (key, index) pair to obtain the sorted permutation of the records followed by actually rearranging the entire records to their final position might not actually be the most efficient way to sort them depending on the type of sorting algor...
متن کاملPerformance Analysis of Odd-even Merge Sort by Using Openmp, Mpi and Concurrent Java
Sorting is a method which arranges the list of elements into a particular order. sorting has two different meanings ordering and categorizing, ordering means to order the list of same items and categorizing means grouping and labeling the same type of items[2]. sorting is used in other algorithms that require sorted list to work efficiently. The odd-even merge sort algorithm was developed by K....
متن کاملA Sort-based Algorithm for Multiple Sequence Alignment *
We propose a sort-based algorithm for multiple sequence alignment using anchors. Anchors are determined by the use of suffix sorting along with position-based sorts. Potential anchor points are identified by a careful exploitation of the sorted suffixes obtained from a generalized suffix array of the input sequences. Final alignment is obtained by a recursive application of the suffix-sorting a...
متن کاملAn Upper Bound on the Number of Circular Transpositions to Sort a Permutation
We consider the problem of upper bounding the number of circular transpositions needed to sort a permutation. It is well known that any permutation can be sorted using at most n(n−1) 2 adjacent transpositions. We show that, if we allow all adjacent transpositions, as well as the transposition that interchanges the element in position 1 with the element in the last position, then the number of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012