设计一个负责排序的程序包，实现多种排序算法，至少包括插入排序、冒泡排序和快速排序算法。

要求：

1.可以对任何简单类型和任意对象进行排序

2.可以支持升序、降序、字典排序等多种顺序要求

3.可以随意增加排序算法和顺序要求，保证其他程序不修改

4.减少程序代码中逻辑上的冗余

5.至少用两种方案编程实现该程序包，并说明两个方案的优缺点

6.提交设计报告，包括：使用UML设计的类图；主要程序代码说明；方案优缺点比较。

-Responsible for designing a sort of package, to achieve a variety of sorting algorithms, including at least insertion sort, bubble sort and quick sort algorithm. Requirements: 1. can be any simple type and any sort objects 2 can support multiple sequential ascending, descending, and other requirements 3. dictionary sort sorting algorithm can be increased and order requirements to ensure that other programs do not modify the program code 4. Reduce 5. redundancy logic programming with at least two solutions to the package, and explain the advantages and disadvantages of the two programs 6. Submit design report, including: design using UML class diagram　the main program code instructions　program strengths and weaknesses comparison.