操作系统介绍笔记梳理

2025年春季周记7

2025年春季周记6

选择排序 Find smallest item. Swap this item to the front and ‘fix’ it. Repeat for unfixed items until all items are fixed. 堆排序 Bottom-up heapify input array. Sink nodes in reve...

#include<bits/stdc++.h> ios::sync_with_stdio(false); cin.tie(nullptr); string 截取字符串 string c = s.substr(pos, len); 翻转字符串 reverse(s.begin(), s.end()); 字符串区间删除 s.erase(pos,n); //删除从pos开始...

程序运行的复杂度的渐近分析