Defining a Modified Cycle Sort Algorithm and Parallel Critique with other Sorting AlgorithmsJournal
: GRD Journal for Engineering (Vol.5, No. 5)
Publication Date: 2020-04-01
Authors : Nakib Aman Turzo; Pritom Sarker; Biplob Kumar; Jyotirmoy Ghose; Amit Chakraborty;
Page : 1-8
Keywords : Sorting Algorithms; Cycle Sort; Merge Sort; Bubble Sort; Selection Sort; Time Complexity;
Source : Download Find it from : Google Scholar
Professionals of computer sciences have to confront with different complexities and problems. The pivot point of the problem which requires the focus is sorting algorithm. Sorting is the rearrangement of items or integers in an ordered way. In this research platform a modified cycle sort algorithm was devised and then comparative study of different sorting algorithms like Selection sort, Merge sort, Cycle sort and Bubble sort is being done. We also used other variety of other sorting algorithms with it. An entirely modified concept which is being sorted out. A program instigated in python has been used for gauging of CPU time taken by each algorithm. Results were obtained after cataloguing and graphically represented. For core precision program was casted a number of times and it's concluded that modified cycle sort was the best option among all linear sorting algorithms where we have duplicate data and for large inputs efficiency has also ascended.
Citation: Nakib Aman Turzo, Pritom Sarker, Biplob Kumar, Jyotirmoy Ghose, Amit Chakraborty. "Defining a Modified Cycle Sort Algorithm and Parallel Critique with other Sorting Algorithms." Global Research and Development Journal For Engineering 5.5 (2020): 1 - 8.
Last modified: 2020-04-01 14:33:26