排序算法:将无序数据排成有序数据的算法,即是排序算法。排序算法是我们利用程序设计解决实际问题中的基础算法,常用的排序算法有冒泡排序、选择排序、插入排序、桶排序、快速排序、归并排序、希尔排序和堆排序。
带着问题看排序:
1.算法的时间复杂度(算法的效率,用O()表示)
2.排序是否稳定:假定在待排序的记录序列中,存在多个具有相同关键字的记录,若经过排序,这些记录的相对次序保持不变,则这种排序算法是稳定的;否则称为不稳定的。
RunID | User | Problem ID | Result | Memory | Time | Language | Code Length | Submit Time |
69866 | huangxijun | H | Accepted | 1936 KB | 4 ms | C++ | 446 bytes | 2021-11-20 16:22:09 |
69843 | huangxijun | Accepted | 1548 KB | 0 ms | C++ | 290 bytes | 2021-11-20 15:38:31 | |
69838 | huangxijun | Accepted | 1548 KB | 0 ms | C++ | 331 bytes | 2021-11-20 15:36:46 | |
69814 | huangxijun | Accepted | 2324 KB | 16 ms | C++ | 429 bytes | 2021-11-20 15:28:08 | |
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 |