• Lavisha Gupta
• Sarvagya Soni
• Poshit Nagda
• Anant Agrawal
• Mayank Patel

Sorting algorithms are the very important data structure operation. As we have millions or trillions of data stored in our memories, it is very difficult for us to find specific required data. To sort data is to arrange them in ascending or descending order so that the searching, locating or arranging of data becomes easy. Every sorting has some advantages and some disadvantages, likewise each sorting algorithm takes different time to sort the data. In this research paper we compared various sorting algorithms in respect to their execution time. The efficiency of every algorithm varies with the number of input and we have compared the efficiency of the algorithm so that we can see which algorithm is best to use based on the load. The sorting algorithms are evaluated in JAVA.

Bubble Sort, Heap Sort, Insertion Sort, Merge Sort, Selection Sort, Sorting Algorithm Evaluation

"A COMPARATIVE STUDY ON ANALYSIS OF SORTING ALGORITHMS COMPLEXITIES ON DIFFERENT LOADS OF NUMERIC AND STRING DATA", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.12, Issue 6, page no.109-115, June-2025, Available :http://www.jetir.org/papers/JETIRGW06019.pdf

"A COMPARATIVE STUDY ON ANALYSIS OF SORTING ALGORITHMS COMPLEXITIES ON DIFFERENT LOADS OF NUMERIC AND STRING DATA", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.12, Issue 6, page no. pp109-115, June-2025, Available at : http://www.jetir.org/papers/JETIRGW06019.pdf