随笔分类 -  排序

快排 PAT 1101
摘要:1101 Quick Sort (25 分) 1101 Quick Sort (25 分) 1101 Quick Sort (25 分) There is a classical process named partition in the famous quick sort algorithm. 阅读全文

posted @ 2019-09-19 15:18 cltt 阅读(163) 评论(0) 推荐(0)

PAT 1098
摘要:1098 Insertion or Heap Sort (25 分) 1098 Insertion or Heap Sort (25 分) 1098 Insertion or Heap Sort (25 分) According to Wikipedia: Insertion sort iterat 阅读全文

posted @ 2019-09-19 11:12 cltt 阅读(180) 评论(0) 推荐(0)

cf 1029 C
摘要:C. Maximal Intersection time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output C. Maximal Inter 阅读全文

posted @ 2018-08-26 11:10 cltt 阅读(249) 评论(0) 推荐(0)

ACM训练联盟周赛 K. Teemo's reunited
摘要:Teemo likes to drink raspberry juice. He even spent some of his spare time tomake the raspberry juice himself. The way to make the raspberries juice i 阅读全文

posted @ 2018-08-21 22:22 cltt 阅读(178) 评论(0) 推荐(0)

归并排序
摘要:1 https://blog.csdn.net/yuehailin/article/details/68961304 1 #include <iostream> 2 #include <cstdio> 3 #include <algorithm> 4 #include <cstring> 5 #in 阅读全文

posted @ 2018-07-25 14:42 cltt 阅读(125) 评论(0) 推荐(0)

导航