Representation of Different Sorting Algorithms Using Sorting Visualizer

The most effective way to sort elements (data) significantly impacts how quickly a computer can complete a task. The sorting algorithm is one of computer science’s most important areas of study. It is the process of arranging unorganized elements in an organized manner. The main goal is to make records easier to search, sort, insert, and delete. Through the description of the existing five sorting algorithms: Bubble, Selection, Insertion, Merge, and Quick Sort, the Time and Space Complexity are determined. Time complexity varies as Best Case(O), Average Case(Θ), and Worst Case(Ω). Here in sorting, the Worst Case complexity is O(n²), and the Best Case complexity is O(n log n), where "n" represents the number of elements(data) in the array. This project consists of a UI-based web application that can visualize the sorting process using various colors and denote the status of the elements of the array.

Representation, Algorithms, Sorting

1. Gugale, Y. (2018, April). Super sort sorting algorithm. In 2018 3rd International Conference for Conver-gence in Technology (I2CT) (pp. 1-5). IEEE. [Google Scholar] [Crossref]

2. Bijoy, M. H. I., Hasan, M. R., & Rabbani, M. (2020, July). RBS: a new comparative and better solution of sorting algorithm for array. In 2020 11th International Conference on Computing, Communication and Networking Technologies (ICCCNT) (pp. 1-5). IEEE. [Google Scholar] [Crossref]

3. Rana, M. S., Hossin, M. A., Mahmud, S. H., Jahan, H., Satter, A. Z., & Bhuiyan, T. (2019). MinFinder: A new approach in sorting algorithm. Procedia Computer Science, 154, 130-136. [Google Scholar] [Crossref]

4. Roy, H., Shafiuzzaman, M., & Samsuddoha, M. (2019, December). SRCS: A New Proposed Counting Sort Algorithm based on Square Root Method. In 2019 22nd International Conference on Computer and Information Technology (ICCIT) (pp. 1-6). IEEE. [Google Scholar] [Crossref]

5. Patel, Y. S., Singh, N. K., & Vashishtha, L. K. (2014, September). Fuse sort algorithm a proposal of divide & conquer based sorting approach with O(n loglog n) time and linear space complexity. In 2014 International Conference on Data Mining and Intelligent Computing (ICDMIC) (pp. 1-6). IEEE. [Google Scholar] [Crossref]

6. Yerram, B., & Bhonagiri, J. K. (2020, July). An efficient sorting algorithm for binary data. In 2020 11th International Conference on Computing, Communication and Networking Technologies (ICCCNT) (pp. 1-4). IEEE. [Google Scholar] [Crossref]

7. Ferrada, H. (2022). A sorting algorithm based on ordered block insertions. Journal of Computational Science, 64, 101866. [Google Scholar] [Crossref]

8. Alotaibi, A., Almutairi, A., & Kurdi, H. (2020). OneByOne (OBO): A fast sorting algorithm. Procedia Computer Science, 175, 270-277. [Google Scholar] [Crossref]

9. Zutshi, A., & Goswami, D. (2021). Systematic review and exploration of new avenues for sorting algo-rithms. International Journal of Information Management Data Insights, 1(2), 100042. [Google Scholar] [Crossref]

10. Garg, A., Patel, V., & Mishra, D. (2022, May). Mid-Point Sorting Algorithm: A New Way to Sort. In 2022 International Conference on Computational Intelligence and Sustainable Engineering Solutions (CISES) (pp. 65-71). IEEE. [Google Scholar] [Crossref]

• Block-Based Programming for Education: A Comprehensive Analysis of Visual Programming Environments in K-12 Learning
• Management of Academic Libraries and Client Satisfaction Towards Digital Utilization: Basis for Monitoring Library Operations in SOCCSKSARGEN Region.
• Revenue Leakages in TPA Insurance Claims and Corporate Claims: An Institutional Overview of Aster Prime Hospital, Hyderabad
• Technology and Innovation in Hospitality and Tourism: A Management Perspective
• Geospatial Distribution of Tarok Sacred Grove of Langtang North and Langtang South Local Government Areas