2000/12/02 by Md. Enamul Karim, Karim, Md. Enamul, Abdun Naser Mahmood +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #Cellular Automata and Applications #DNA and Biological Computing #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences
paper · pdf · doi:10.48550/arxiv.cs/0012002
openalex publication_date 2000/12/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we present a random shuffling scheme to apply with adaptive sorting algorithms. Adaptive sorting algorithms utilize the presortedness present in a given sequence. We have probabilistically increased the amount of presortedness present in a sequence by using a random shuffling technique that requires little computation. Theoretical analysis suggests that the proposed scheme can improve the performance of adaptive sorting. Experimental results show that it significantly reduces the amount of disorder present in a given sequence and improves the execution time of adaptive sorting algorithm as well.