排序算法:将无序数据排成有序数据的算法,即是排序算法。排序算法是我们利用程序设计解决实际问题中的基础算法,常用的排序算法有冒泡排序、选择排序、插入排序、桶排序、快速排序、归并排序、希尔排序和堆排序。
带着问题看排序:
1.算法的时间复杂度(算法的效率,用O()表示)
2.排序是否稳定:假定在待排序的记录序列中,存在多个具有相同关键字的记录,若经过排序,这些记录的相对次序保持不变,则这种排序算法是稳定的;否则称为不稳定的。
RunID | User | Problem ID | Result | Memory | Time | Language | Code Length | Submit Time |
69953 | vabcd | Accepted | 1936 KB | 64 ms | C++ | 504 bytes | 2021-11-20 20:56:39 | |
69944 | vabcd | Time Limit Exceed | 2292 KB | 1992 ms | C++ | 467 bytes | 2021-11-20 20:43:48 | |
69938 | vabcd | Time Limit Exceed | 2296 KB | 2004 ms | C++ | 493 bytes | 2021-11-20 20:37:43 | |
69937 | vabcd | Time Limit Exceed | 2296 KB | 2004 ms | C++ | 491 bytes | 2021-11-20 20:36:21 | |
69935 | vabcd | Time Limit Exceed | 2288 KB | 2012 ms | C++ | 484 bytes | 2021-11-20 20:31:16 | |
69928 | vabcd | Time Limit Exceed | 2284 KB | 2004 ms | C++ | 474 bytes | 2021-11-20 20:14:00 | |
69923 | vabcd | Time Limit Exceed | 2288 KB | 2004 ms | C++ | 474 bytes | 2021-11-20 20:03:00 | |
69918 | vabcd | Accepted | 1812 KB | 112 ms | C++ | 418 bytes | 2021-11-20 19:31:14 | |
69901 | vabcd | Time Limit Exceed | 1812 KB | 2000 ms | C++ | 415 bytes | 2021-11-20 19:08:10 | |
69899 | vabcd | Time Limit Exceed | 1812 KB | 1972 ms | C++ | 417 bytes | 2021-11-20 19:07:26 | |
69896 | vabcd | Time Limit Exceed | 1812 KB | 2008 ms | C++ | 395 bytes | 2021-11-20 19:05:23 |