CFP last date
15 March 2024
Reseach Article

Freezing Sort

by Surmeet Kaur, Tarundeep Singh, Parveen Kumar
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
10.5120/ijais12-450330

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

@article{ 10.5120/ijais12-450330,
author = { Surmeet Kaur, Tarundeep Singh, Parveen Kumar },
title = { Freezing Sort },
journal = { International Journal of Applied Information Systems },
issue_date = { May 2012 },
volume = { 2 },
number = { 4 },
month = { May },
year = { 2012 },
issn = { 2249-0868 },
pages = { 18-22 },
numpages = {9},
url = { https://www.ijais.org/archives/volume2/number4/149-0330/ },
doi = { 10.5120/ijais12-450330 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-07-05T10:43:28.644963+05:30
%A Surmeet Kaur
%A Tarundeep Singh
%A Parveen Kumar
%T Freezing Sort
%J International Journal of Applied Information Systems
%@ 2249-0868
%V 2
%N 4
%P 18-22
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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. [1] 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.

References
  1. Knuth D. E,"The art of programming- sorting and searching,". 2nd edition Addison Wesley.
  2. D. E. Knuth, Sorting and Searching, volume 3 of "The Art of Computer Programming". Addison Wesley, Reading, MA, (1973)
  3. Cormen T. , Leiserson C. , Rivest R. , and Stein C. , "Introduction to Algorithms," McGraw Hill, (2001)
  4. RupeshSrivastava,TarunTiwari,Sweetes Singh,"Bidirectional Expansion – Insertion Algorithm for Sorting,"Second International Conference on Emerging Trends in Engineering and Technology, ICETET-09. (2009).
  5. Rami Mansi,"Enhanced Quicksort Algorithm," The International Arab Journal of Information Technology, Vol. 7, No. 2. (2010).
  6. Jehad Alnihoud and Rami Mansi," An Enhancement of Major Sorting Algorithms," The International Arab Journal of Information Technology, Vol. 7. (2010)
  7. Muhammad Anjum Qureshi," Qureshi Sort: A new Sorting Algorithm,". (2010)
  8. Oyelami Olufemi Moses," Improving the performance of bubble sort using a modified diminishing increment sorting,". Scientific Research and Essay Vol. 4 (8), pp. 740-744. (2009)
  9. Vandana Sharma, Satwinder Singh and Dr. K. S. Kahlon, "Performance Study of Improved Heap Sort Algorithm and Other Sorting Algorithms on Different Platforms,"IJCSNS International Journal of Computer Science and Network Security, VOL. 8 No. 4. (2008)
  10. Seymour Lpischutz, G A Vijayalakshmi Pai (2006) "Data Structures", Tata McGraw-Hill Publishing Company Limited, p. 4. 11, 9. 6, 9. 8.
  11. You Yang, Ping Yu, Yan Gan, "Experimental Study on the Five Sort Algorithms", International Conference on Mechanic Automation and Control Engineering (MACE), 2011.
  12. Wang Min "Analysis on 2-Element Insertion Sort Algorithm", International Conference on Computer Design And Appliations (ICCDA), 2010.
  13. Sultanullah Jadoon , Salman Faiz Solehria, Prof. Dr. Salim ur Rehman, Prof. Hamid Jan , "Design and Analysis of Optimized Selection Sort Algorithm" International Journal of Electric & Computer Sciences IJECS-IJENS Vol: 11 No: 01, February 2011.
  14. Sultanullah Jadoon, Salman Faiz Solehria, Mubashir Qayum, "Optimized Selection Sort Algorithm is faster than Insertion Sort Algorithm: a Comparative Study" International Journal of Electrical & Computer Sciences IJECS-IJENS Vol: 11 No: 02, April 2011.
  15. Wang Min "Analysis on 2-Element Insertion Sort Algorithm", International Conference on Computer Design And Appliations (ICCDA), 2010.
Index Terms

Computer Science
Information Sciences

Keywords

Algorithm Complexity Bubble Sort Selection Sort.