排序算法:将无序数据排成有序数据的算法,即是排序算法。排序算法是我们利用程序设计解决实际问题中的基础算法,常用的排序算法有冒泡排序、选择排序、插入排序、桶排序、快速排序、归并排序、希尔排序和堆排序。
带着问题看排序:
1.算法的时间复杂度(算法的效率,用O()表示)
2.排序是否稳定:假定在待排序的记录序列中,存在多个具有相同关键字的记录,若经过排序,这些记录的相对次序保持不变,则这种排序算法是稳定的;否则称为不稳定的。
| RunID | User | Problem ID | Result | Memory | Time | Language | Code Length | Submit Time |
| 69872 | lzc121212 | Accepted | 1584 KB | 16 ms | C++ | 318 bytes | 2021-11-20 16:24:01 | |
| 69870 | lzc121212 | Time Limit Exceed | 1584 KB | 1996 ms | C++ | 318 bytes | 2021-11-20 16:23:30 | |
| 69860 | lzc121212 | Accepted | 1548 KB | 0 ms | C++ | 241 bytes | 2021-11-20 16:17:31 | |
| 69837 | lzc121212 | Accepted | 1936 KB | 144 ms | C++ | 322 bytes | 2021-11-20 15:36:42 | |
| 69827 | lzc121212 | Wrong Answer | 1584 KB | 220 ms | C++ | 366 bytes | 2021-11-20 15:33:17 | |
| 69818 | lzc121212 | Wrong Answer | 1936 KB | 4 ms | C++ | 315 bytes | 2021-11-20 15:28:54 | |
| 69805 | lzc121212 | Wrong Answer | 1584 KB | 228 ms | C++ | 342 bytes | 2021-11-20 15:23:07 | |
| 69785 | lzc121212 | Wrong Answer | 1584 KB | 220 ms | C++ | 344 bytes | 2021-11-20 15:06:07 |