排序算法:将无序数据排成有序数据的算法,即是排序算法。排序算法是我们利用程序设计解决实际问题中的基础算法,常用的排序算法有冒泡排序、选择排序、插入排序、桶排序、快速排序、归并排序、希尔排序和堆排序。
带着问题看排序:
1.算法的时间复杂度(算法的效率,用O()表示)
2.排序是否稳定:假定在待排序的记录序列中,存在多个具有相同关键字的记录,若经过排序,这些记录的相对次序保持不变,则这种排序算法是稳定的;否则称为不稳定的。
RunID | User | Problem ID | Result | Memory | Time | Language | Code Length | Submit Time |
69873 | yangjunhui | Accepted | 1584 KB | 0 ms | C++ | 486 bytes | 2021-11-20 16:24:08 | |
69867 | yangjunhui | Accepted | 1584 KB | 20 ms | C++ | 335 bytes | 2021-11-20 16:22:25 | |
69863 | yangjunhui | B | Accepted | 1936 KB | 148 ms | C++ | 330 bytes | 2021-11-20 16:19:04 |
69858 | yangjunhui | B | Wrong Answer | 1936 KB | 128 ms | C++ | 333 bytes | 2021-11-20 16:14:18 |
69857 | yangjunhui | B | Compile Error | 0 KB | 0 ms | C++ | 332 bytes | 2021-11-20 16:13:55 |
69856 | yangjunhui | B | Compile Error | 0 KB | 0 ms | C++ | 309 bytes | 2021-11-20 16:13:04 |
69855 | yangjunhui | B | Wrong Answer | 5452 KB | 12 ms | C++ | 368 bytes | 2021-11-20 16:11:24 |
69846 | yangjunhui | Accepted | 5452 KB | 212 ms | C++ | 368 bytes | 2021-11-20 15:39:20 | |
69844 | yangjunhui | Compile Error | 0 KB | 0 ms | C++ | 367 bytes | 2021-11-20 15:38:51 | |
69840 | yangjunhui | Wrong Answer | 5452 KB | 60 ms | C++ | 337 bytes | 2021-11-20 15:37:20 | |
69833 | yangjunhui | Compile Error | 0 KB | 0 ms | C++ | 314 bytes | 2021-11-20 15:35:10 |