@[chrispang](/user/786127) so?我们有 `sort()` 哦
by WydnksqhbD @ 2024-04-08 21:44:17
@[chrispang](/user/786127) md说之前先算算复杂度的思路啊！！
by query_getfa @ 2024-04-08 21:45:18
@[chrispang](/user/786127) 真以为排序只有冒泡啊，但是我们的冒泡也是很有用的/cf
by query_getfa @ 2024-04-08 21:46:38
@[chrispang](/user/786127) /cf /cf
by WydnksqhbD @ 2024-04-08 21:48:23
@[chrispang](/user/786127) https://www.luogu.com.cn/record/154960175
/cf/cf/cf
by query_getfa @ 2024-04-08 21:49:55
@[query_getfa](/user/1061770) 不能查看（
by WydnksqhbD @ 2024-04-08 21:50:44
@[query_getfa](/user/1061770) 应该是O(n^2),跟冒泡一个复杂度
by VirtualImage @ 2024-04-08 21:51:41
@[VirtualImage](/user/1278584) 那为啥用这么麻烦去写这么长
by query_getfa @ 2024-04-08 21:54:04
@[query_getfa](/user/1061770) 有逝呗（）
by WydnksqhbD @ 2024-04-08 21:55:06
@[query_getfa](/user/1061770) 你那个题目是规定时间复杂度为O(nlogn)的，我这个只是比冒泡快一点
by chrispang @ 2024-04-08 21:55:31