@Article{jbd.2021.017017,
AUTHOR = {Jiajun Xie, Zuyan Li, Han Wu, Linhan Li, Bin Pan, Peng Guo,Guang Sun1,*},
TITLE = {Application of Quicksort Algorithm in Information Retrieval},
JOURNAL = {Journal on Big Data},
VOLUME = {3},
YEAR = {2021},
NUMBER = {4},
PAGES = {135--145},
URL = {http://www.techscience.com/jbd/v3n4/46033},
ISSN = {2579-0056},
ABSTRACT = {With the development and progress of today’s network information 
technology, a variety of large-scale network databases have emerged with the 
situation, such as Baidu Library and Weipu Database, the number of documents 
in the inventory has reached nearly one million. So how do you quickly and 
effectively retrieve the information you want in such a huge database? This 
requires finding efficient algorithms to reduce the computational complexity of 
the computer during Information Retrieval, improve retrieval efficiency, and 
adapt to the rapid expansion of document data. The Quicksort Algorithm gives 
different weights to each position of the document, and multiplies the weight of 
each position with the number of matches of that position, and then adds all the 
multiplied sums to set a feature value for Quicksort, which can achieve the full 
accuracy of Information Retrieval. Therefore, the purpose of this paper is to use 
the quick sort algorithm to increase the speed of Information Retrieval, and to 
use the position weighting algorithm to improve the matching quality of 
Information Retrieval, so as to achieve the overall effect of improving the 
efficiency of Information Retrieval.},
DOI = {10.32604/jbd.2021.017017}
}