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.