So far, we have learned many sorting algorithms. Please select the corresponding algorithm according to the description迄今为止，我们已经学过许多种排序算法了，请根据描述选择对应的算法(请填入选项大写字母）
A,quicksort 快速排序
B,radixsort 基数排序
C,countsort 计数排序
D,heapsort 堆排序
E,mergesort 归并排序
F,insestsort 插入排序
G,shellsort 希尔排序
H,bubblesort 冒泡排序
Repeatedly compare adjacent elements, swapping them if they are in reverse order until ordered:反复比较相邻元素，若为逆序则交换，直至有序：[填空1]
The original sequence is divided into two parts with the pivot as the boundary. Recursively sort them separately:将原序列以轴点为界分为两部分，递归地对它们分别排序[填空2]
Sort the first half and the second half of the original sequence, and merge the two parts:将原序列前半部分和后半部分，分别排序，再将这两部分合并：[填空3]
Constantly remove the smallest element from the original sequence:不断从原序列中取出最小元素：[填空4]
The elements in the original sequence are a range of integers, the sorting result can be obtained by calculating the number of occurrences of each possible integer:原序列中的元素是一定范围内的整数，计算每个可能的整数在其中出现的次数，便可得排序结果[填空5]
The sorting method people usually use when playing cards:抓扑克牌时人们常用的排序方法：[填空6]