TECHNIQUES AND TRADEOFFS IN SORTING ALGORITHMS: A REVIEW

Anshuman Narayan; Anurag Unnikrishnan; Siddharth Benedict Dias; H S Guruprasad

Article Information

Published In Volume 1, Issue 4 (2015)
Publication Date July 24, 2026
Manuscript ID IJCRCST-JULY15-02
Article Type Research Paper
Pages 97 - 102
7 Views 0 Downloads

Abstract

Towards the dawn of the 20th century, there have been numerous advancements in the field of computing. This has been possible because of the cumulative efforts of not only the intelligentsia but also due to the rise in the computational capabilities of machines. One of these advancements is the number of sorting algorithms that are available today. Numerous algorithms have been developed for different purposes, each one more unprecedented than the other. This papers deals with a heterogeneous combination of such sorting algorithms, where the purpose and idea behind each one is explained in a brief yet transparent manner.

Keywords

Sorting Algorithms Time Complexity Space Complexity Parallel Processing Algorithm Analysis

Authors

Anshuman Narayan

Anurag Unnikrishnan

Siddharth Benedict Dias

H S Guruprasad

How to Cite this Article

Anshuman Narayan, Anurag Unnikrishnan, Siddharth Benedict Dias, H S Guruprasad (2015). "TECHNIQUES AND TRADEOFFS IN SORTING ALGORITHMS: A REVIEW". International Journal of Contemporary Research in Computer Science and Technology, 1(4), pp. 97-102.