IDEAS home Printed from https://ideas.repec.org/a/bjf/ijltem/v15y2026i5a2469.html

Representation of Different Sorting Algorithms Using Sorting Visualizer

Author

Listed:
  • Ashish Gautam

    (Assistant Professor, Computer Science & Engineering, Creanovation Technologies Private Limited, NextGen Academy, Mohali, Punjab, India)

  • Deepak Thakur

    (Assistant Professor, Computer Science & Engineering, Creanovation Technologies Private Limited, NextGen Academy, Mohali, Punjab, India)

Abstract

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(n2), 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.

Suggested Citation

  • Ashish Gautam & Deepak Thakur, 2026. "Representation of Different Sorting Algorithms Using Sorting Visualizer," International Journal of Latest Technology in Engineering, Management & Applied Science, RSIS International, vol. 15(5), pages 444-454, May.
  • Handle: RePEc:bjf:ijltem:v:15:y:2026:i:5:a:2469
    DOI: 10.51583/IJLTEMAS.2026.150500040
    as

    Download full text from publisher

    File URL: https://www.ijltemas.in/submission/online/article/view/4722/6404
    Download Restriction: no

    File URL: https://www.ijltemas.in/submission/online/article/view/4722
    Download Restriction: no

    File URL: https://libkey.io/10.51583/IJLTEMAS.2026.150500040?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bjf:ijltem:v:15:y:2026:i:5:a:2469. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Dr. Pawan Verma (email available below). General contact details of provider: https://www.ijltemas.in/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.