QuickRanking: Fast Algorithm For Sorting And Ranking Data

Abstract

Fichiers produits par l'auteurQuickRanking: Fast Algorithm For Sorting And Ranking Data QuickRanking is an algorithm that allows in a same processing, to sort the data and to return their ranking, that is to say their rank in the sorting. For faster processing, QuickRanking does not move data, but stores for each data, where the following data is. To evaluate the effectiveness of QuickRanking, I compared with QuickSort on lists of random data.- Sorting and classification of digital data: QuickSort is more efficient than QuickRanking only on large lists of data. QuickRanking takes the advantage in other cases. Advantage emphasised when the data at the beginning of the list are already classified, when the list is made up of few different values, or when the minimum or maximum value is often represented.- Sorting and classification of alphanumeric data, or sorting only: QuickRanking is often faster than QuickSort. Advantage emphasised on the processing of large chains of characters. Conclusion: ideally random list or highly classified list, large data or reduced size data, numeric or alphanumeric data, the reality is often between these extremes. In practice, QuickRanking may provide an interesting alternative to QuickSort. All information is in the attachment