Design and Implementation of SortLab: A Computer Program for Comparative Analysis of Classical Sorting Algorithms

Author(s)	Ms. Bade Jyothi
Country	India
Abstract	This paper presents SortLab, a single command-line computer program written in Python for the study of classical sorting algorithms in a computer science laboratory. The program implements Bubble Sort, Insertion Sort, Merge Sort, Quick Sort and Heap Sort on the same input array, checks that each output is correctly ordered, and records wall-clock time, comparison count and data movement count. Arrays of size 200, 500, 1000 and 2000 were generated from a fixed random seed so that the trial can be repeated. Measured times confirm the expected gap between quadratic methods and O(n log n) methods. At n = 1000, Bubble Sort required 43.910 ms and 495759 comparisons, while Quick Sort required 1.149 ms and 10693 comparisons on the same data. The paper describes the problem, the program structure, the algorithms, the test method, the results and the classroom use of the program. SortLab is offered as a compact teaching artefact rather than as a replacement for library sort routines.
Keywords	Sorting Algorithms, Computer Program, Algorithm Analysis, Python, Quick Sort, Merge Sort, Computer Science Education
Field	Computer Applications
Published In	Volume 8, Issue 4, July-August 2026
Published On	2026-08-27
DOI	https://doi.org/10.36948/ijfmr.2026.v08i04.86749

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9687-828-838	editor@ijfmr.com

International Journal For Multidisciplinary Research