c++快速排序排几轮

根据引用中的代码，我们可以看到在使用快速排序算法对一个vector进行排序时，调用了`quickSort(num_1, 0, num_1.size() - 1)`函数。这个函数中的参数`num_1.size() - 1`表示排序的范围是从0到`num_1.size() - 1`，也就是整个vector的范围。所以快速排序将对整个vector进行排序。但是根据提供的引用内容，我们无法判断具体排了几轮。<span class="em">1</span><span class="em">2</span><span class="em">3</span>
#### 引用[.reference_title]
- *1* *2* [c++ 十大排序之快速排序解法](https://blog.csdn.net/m0_64862090/article/details/127498839)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_1"}}] [.reference_item style="max-width: 50%"]
- *3* [C/C++排序算法（三）—— 冒泡排序和快速排序](https://blog.csdn.net/m0_63325890/article/details/127195045)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_1"}}] [.reference_item style="max-width: 50%"]
[ .reference_list ]