Quick algorithm for finding the kth real data

This paper makes further research to the storage structure of the real data inside the computer and finds the contained rule. Based on this rule, it puts forward a quick algorithm of finding the kth data from real data sets. The time complexity of the algorithm is lower than traditional searching algorithm based on comparison. The added storage space is very small. The above conclusion is proved to be correct through the experiment at the end of this paper.