Open AccessA Unified Vista and Juxtaposed Study on Sorting Algorithms
Author(s) -
Anurag Dutta,
Veenu Chhabra,
Pijush Kanti Kumar
Publication year - 2022
Publication title -
international journal of computer science and mobile computing
Language(s) - English
Resource type - Journals
ISSN - 2320-088X
DOI - 10.47760/ijcsmc.2022.v11i03.014
Subject(s) - merge (version control) , computer science , sorting , data structure , algorithm , sorting algorithm , database , distributed computing , data mining , parallel computing , programming language
Data is the new fuel. With the expansion of the global technology, the in-creasing standards of living and with modernization, data values have caught a great height. Now a days, nearly all top MNCs feed on data. Now, to store all this data is a prime concern for all of them, which is relieved by the Data Structures, the systematic way of storing data. Now, once these data are stored and charged in secure vaults, it’s time to utilize them in the most efficient way. Now, there are a lot of operations that needs to be performed on these massive chunks of data, like searching, sorting, inserting, deleting, merging and so more. In this paper, we would be comparing all the major sorting algorithms that have prevailed till date. Further, work have been done and an inequality in dimension of time between the four Sorting algorithms, Bubble, Selection, Insertion, Merge, that have been discussed in the paper have been proposed.