Open Access Open Access  Restricted Access Subscription Access

Sorting

Tarun Bhandari

Abstract


Our research paper aims at sorting. Sorting is any process of arranging items according to a certain sequence or in different sets. It is a term that is used to sort the data in ascending or descending order. In this paper, we will discuss about internal and external sorting, and also about some terminologies in this, like: insertion sort, merge sort, quick short, heap short, bubble sort, radix sort and selection sort. We will also discuss about the simple sort, shell sort, comb sort and distribution sort. A comparison of algorithms is also provided in brief detail.

Cite this Article
Tarun Bhandari. Sorting. Recent Trends in Programming Languages. 2016; 3(2): 4–6p.


Keywords


Internal and external sort, com basic concept, internal sort

Full Text:

PDF

References


Dinesh Thakur. What is Sorting? Type of Sorting. Online available from http://ecomputernotes.com/data-structures/ searching-and-sorting/what-is-sorting-type-of-sorting [Accessed on July 2016].

Wikipedia. (2016). Sorting. Online available from http://en.wikipedia. org/wiki/Sorting [Accessed on July 2016].

Kristoffer Vinther. Engineering Cache-Oblivious Sorting Algorithms. Online available from http://kristoffer.vinther. name/academia/thesis/conclusion.pdf [Accessed on July 2016].


Refbacks

  • There are currently no refbacks.