Random Shuffling to Reduce Disorder in Adaptive Sorting Scheme

Details Random Shuffling to Reduce Disorder in Adaptive Sorting Scheme Random Shuffling to Reduce Disorder in Adaptive Sorting Scheme

2000-12-02

arxiv.org/abs/cs/0012002v1

Computer Science

Data Structures and Algorithms

7 pages, 2 tables

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Random Shuffling to Reduce Disorder in Adaptive Sorting Scheme does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random Shuffling to Reduce Disorder in Adaptive Sorting Scheme, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random Shuffling to Reduce Disorder in Adaptive Sorting Scheme will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-463965