Behavior Analysis of Memorized Sort on Randomly Colonized Data Sets

Download Now
Provided by: Creative Commons
Topic: Big Data
Format: PDF
Memorized sort performs sorting by computing sorted sub-sequences of different sizes in a random data set. Each sub-sequence can be considered as a data colony populated with random numbers. These colonies have different population of elements due to their random nature. Increased population of colonies can give better performance of memorized sort algorithm. The running time of memorized sort may vary as the entropy of the colonized list is changed. This paper shows the behavior of memorized sort on colonized random data sets with increased population.
Download Now

Find By Topic