排序算法:将无序数据排成有序数据的算法,即是排序算法。排序算法是我们利用程序设计解决实际问题中的基础算法,常用的排序算法有冒泡排序、选择排序、插入排序、桶排序、快速排序、归并排序、希尔排序和堆排序。
带着问题看排序:
1.算法的时间复杂度(算法的效率,用O()表示)
2.排序是否稳定:假定在待排序的记录序列中,存在多个具有相同关键字的记录,若经过排序,这些记录的相对次序保持不变,则这种排序算法是稳定的;否则称为不稳定的。
RunID | User | Problem ID | Result | Memory | Time | Language | Code Length | Submit Time |
69809 | cza2021 | Time Limit Exceed | 1932 KB | 2000 ms | C++ | 421 bytes | 2021-11-20 15:24:58 | |
69808 | zxj6116 | Accepted | 1936 KB | 196 ms | C++ | 377 bytes | 2021-11-20 15:24:38 | |
69806 | cza2021 | Time Limit Exceed | 1932 KB | 2004 ms | C++ | 399 bytes | 2021-11-20 15:23:13 | |
69805 | lzc121212 | Wrong Answer | 1584 KB | 228 ms | C++ | 342 bytes | 2021-11-20 15:23:07 | |
69787 | cza2021 | Time Limit Exceed | 1932 KB | 2000 ms | C++ | 398 bytes | 2021-11-20 15:09:20 | |
69785 | lzc121212 | Wrong Answer | 1584 KB | 220 ms | C++ | 344 bytes | 2021-11-20 15:06:07 | |
69784 | 1992763685 | Accepted | 1936 KB | 204 ms | C++ | 384 bytes | 2021-11-20 15:05:58 | |
69781 | 1992763685 | Runtime Error | 1544 KB | 0 ms | C++ | 373 bytes | 2021-11-20 15:03:45 | |
69780 | huangxijun | B | Accepted | 1936 KB | 128 ms | C++ | 378 bytes | 2021-11-20 15:03:22 |
69773 | huangxijun | Accepted | 1936 KB | 212 ms | C++ | 372 bytes | 2021-11-20 14:57:02 | |
69771 | huangxijun | Wrong Answer | 1936 KB | 212 ms | C++ | 370 bytes | 2021-11-20 14:56:02 | |
69766 | huangxijun | Wrong Answer | 1936 KB | 212 ms | C++ | 370 bytes | 2021-11-20 14:52:07 | |
69764 | huangxijun | Wrong Answer | 1936 KB | 212 ms | C++ | 370 bytes | 2021-11-20 14:50:12 | |
69759 | leon | B | Accepted | 1936 KB | 128 ms | C++ | 368 bytes | 2021-11-20 14:40:44 |
69758 | leon | Accepted | 1936 KB | 212 ms | C++ | 471 bytes | 2021-11-20 14:29:46 | |
69757 | leon | Time Limit Exceed | 1936 KB | 2008 ms | C++ | 347 bytes | 2021-11-20 14:15:39 | |
68952 | leon | Accepted | 1556 KB | 0 ms | C++ | 648 bytes | 2021-11-11 14:22:51 | |
68796 | liuwanchen2020 | Runtime Error | 1544 KB | 0 ms | C++ | 296 bytes | 2021-11-10 12:40:28 |