|International Journal of Applied Information Systems
|Foundation of Computer Science (FCS), NY, USA
|Volume 2 - Number 4
|Year of Publication: 2012
|Authors: Surmeet Kaur, Tarundeep Singh, Parveen Kumar
Surmeet Kaur, Tarundeep Singh, Parveen Kumar . Freezing Sort. International Journal of Applied Information Systems. 2, 4 ( May 2012), 18-22. DOI=10.5120/ijais12-450330
The term algorithm is now applied to many kinds of problem solving, such as in setting up a computer program. An algorithm is as a finite sequence of steps, that can be used for solving many problems. copied Algorithms are used for calculation, data processing, and many other fields. In computer science and mathematics, a sorting algorithm is an algorithm that puts elements of a list in a certain order, not necessarily in increasing order, it may be in decreasing order as well. Efficient sorting is important to optimizing the use of other algorithms that require sorted lists to work efficiently; it is also often useful for producing human- readable output.  In this paper we present a new sorting algorithm, named as freezing algorithm, which uses the methodology of bubble sort efficiently to give a much better performance than the existing sorting algorithms of the O (n2) class. We prove the correctness of the algorithm and give a detailed time complexity analysis of the algorithm.