2022.02.13

Priority queues are heap based , The heap can be regarded as a complete binary tree . Priority queues can be stored in many ways , If represented by an array , There will be two cases of maximum heap and minimum heap , But in either case , In the process of building the reactor , We always need words O（n） The time complexity to complete the pile building

For details, see ：https://blog.csdn.net/fugitive1/article/details/92656373?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522164475587016780366538048%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=164475587016780366538048&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~sobaiduend~default-1-92656373.first_rank_v2_pc_rank_v29&utm_term=%E5%A0%86%E7%9A%84%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6&spm=1018.2226.3001.4187https://blog.csdn.net/fugitive1/article/details/92656373?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522164475587016780366538048%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=164475587016780366538048&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~sobaiduend~default-1-92656373.first_rank_v2_pc_rank_v29&utm_term=%E5%A0%86%E7%9A%84%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6&spm=1018.2226.3001.4187 Then we input one element at a time , Must satisfy the nature of a large top pile or a small top pile , So we need to decide whether to sink or float according to the nature , At the same time, determine their corresponding positions , need logn Time complexity of , So if the priority queue is represented by an array, it is nlogn