Open Access   Article Go Back

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

Mehzabeen Kaur1 , Surender Jangra2

Section:Research Paper, Product Type: Journal Paper
Volume-6 , Issue-9 , Page no. 786-788, Sep-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i9.786788

Online published on Sep 30, 2018

Copyright © Mehzabeen Kaur, Surender Jangra . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Mehzabeen Kaur, Surender Jangra, “Execution Time of Quick Sort on Different C Compilers: A Benchmark,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.9, pp.786-788, 2018.

MLA Style Citation: Mehzabeen Kaur, Surender Jangra "Execution Time of Quick Sort on Different C Compilers: A Benchmark." International Journal of Computer Sciences and Engineering 6.9 (2018): 786-788.

APA Style Citation: Mehzabeen Kaur, Surender Jangra, (2018). Execution Time of Quick Sort on Different C Compilers: A Benchmark. International Journal of Computer Sciences and Engineering, 6(9), 786-788.

BibTex Style Citation:
@article{Kaur_2018,
author = {Mehzabeen Kaur, Surender Jangra},
title = {Execution Time of Quick Sort on Different C Compilers: A Benchmark},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {9 2018},
volume = {6},
Issue = {9},
month = {9},
year = {2018},
issn = {2347-2693},
pages = {786-788},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=2944},
doi = {https://doi.org/10.26438/ijcse/v6i9.786788}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i9.786788}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=2944
TI - Execution Time of Quick Sort on Different C Compilers: A Benchmark
T2 - International Journal of Computer Sciences and Engineering
AU - Mehzabeen Kaur, Surender Jangra
PY - 2018
DA - 2018/09/30
PB - IJCSE, Indore, INDIA
SP - 786-788
IS - 9
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
479 404 downloads 267 downloads
  
  
           

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.

Key-Words / Index Term

Borland, Digital Mars, Tiny C, Bloodshed, CC386

References

[1] Karp and H. T. Kung, “GPSR: greedy perimeter stateless routing for wireless networks”, in Mobile Computing and Networking, 2000, pp. 243–254.
[2] https://en.wikipedia.org/wiki/List_of_compilers
[3] https://en.wikipedia.org/wiki/Tiny_C_Compiler
[4] http://ladsoft.tripod.com/cc386_compiler.html