Execution Time of Quick Sort on Different C Compilers: A Benchmark

Authors

  • Kaur M Dept. of Computer Science & Engineering, BBSBEC, Fatehgarh Sahib, Punjab, India
  • Jangra S Dept. of Computer Science, Guru Teg Bahadur College, Bhawanigarh, Sangrur, Punjab, India

DOI:

https://doi.org/10.26438/ijcse/v6i9.786788

Keywords:

Borland, Digital Mars, Tiny C, Bloodshed, CC386

Abstract

Sorting is a process of arranging the elements in specific order. Computer systems use many sorting algorithms to arrange the numbers in ascending or descending order and ‘quicksort’ is one of the better performing algorithms. This algorithm follows divide-and-conquer approach by compiling the large data set to partition the list of elements and then exchange the numbers after scanning the list. In today’s ever expanding world of technology, users find themselves in a situation where they have so many choices in selecting the best compilers. However, most of the time, technically the users are not able to identifying which translator is the best one for the completion of a particular assignment. The main aim of this paper is to find out the best compiler for ‘quick sort’ to reduce the execution time and automation through analyzing the performance of different compilers

References

Karp and H. T. Kung, “GPSR: greedy perimeter stateless routing for wireless networks”, in Mobile Computing and Networking, 2000, pp. 243–254.

https://en.wikipedia.org/wiki/List_of_compilers

https://en.wikipedia.org/wiki/Tiny_C_Compiler

http://ladsoft.tripod.com/cc386_compiler.html

Downloads

Published

2025-11-15
CITATION
DOI: 10.26438/ijcse/v6i9.786788
Published: 2025-11-15

How to Cite

[1]
M. Kaur and S. Jangra, “Execution Time of Quick Sort on Different C Compilers: A Benchmark”, Int. J. Comp. Sci. Eng., vol. 6, no. 9, pp. 786–788, Nov. 2025.

Issue

Section

Research Article