Sökning: "DynamicSort"
Hittade 1 uppsats innehållade ordet DynamicSort.
1. A dynamic approach to sorting with respect to big data
Master-uppsats, Umeå universitet/Institutionen för datavetenskapSammanfattning : This study introduces a dynamic approach to sorting, making use of predictions and data gathered during run-time to optimize the sorting of the current data set. This approach is used to develop a sorting algorithm called DynamicSort which partitions data and calculates a partial standard deviation for each partition to determine which of two sorting algorithms should be used to sort the partition. LÄS MER
Resultatsidor:
1