• Atul Sharma
• Akshit Bhandari
• Dr. Shilpa Bhalerao
• Prof. Shruti Lashkari

This research paper presents a brief analysis of major sorting algorithms in terms of their time and space complexities in varying circumstances. The paper compares Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, and Heap Sort on the basis of performance in best case, worst case, and average case. Space complexity is also analyzed to determine the amount of space each algorithm would need. Graphs are shown to compare algorithm efficiency for different input sizes. Moreover, the paper also studies the implementation of these algorithms within Windows and Linux operating systems. It emphasizes how they are significant in process scheduling, file system organization, and memory management. Certain OS-level implementations and optimizations are discussed here, showing how sorting algorithms benefit system performance. Real-world test cases are used to analyze the effectiveness of the algorithms in operating system operations. The article concludes by presenting recommendations for the choice of appropriate algorithms for given OS functions and provides potential future areas for optimization and research into operating system design and performance.

Sorting algorithms, time complexity, space complexity, big data analytics, memory utilization, operating systems,Linux.

"Comparative Study and Analysis of Sorting Algorithms and Their Application in Operating Systems", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.12, Issue 5, page no.599-603, May-2025, Available :http://www.jetir.org/papers/JETIRGV06084.pdf

"Comparative Study and Analysis of Sorting Algorithms and Their Application in Operating Systems", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.12, Issue 5, page no. pp599-603, May-2025, Available at : http://www.jetir.org/papers/JETIRGV06084.pdf