贪心算法活动安排时间复杂度

贪心算法活动安排的时间复杂度是O(nlogn)，其中n是活动的数量。这是因为在贪心算法中，我们需要对活动按照结束时间进行排序，这个排序的时间复杂度是O(nlogn)。然后，在遍历排序后的活动列表时，每次选择结束时间最早的活动，这个步骤的时间复杂度是O(n)。因此，贪心算法活动安排的总体时间复杂度是O(nlogn)。<span class="em">1</span><span class="em">2</span><span class="em">3</span>
#### 引用[.reference_title]
- *1* *2* [算法分析-贪心算法](https://blog.csdn.net/qq_51922077/article/details/125579013)[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* [【趣学算法】贪心算法](https://blog.csdn.net/weixin_47936614/article/details/127487149)[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 ]