Introduction - If you have any usage issues, please Google them yourself
This procedure implemented algorithms: bubble sort, shell sort, quick sort, merge sort (1) Let n keywords are integers (1 ≤ n ≤ 100000) (2) Design K internal sorting algorithms (K ≥ 5) Each algorithm is required to keep records to perform the required time (3) automatically generates multiple sets of data, each data containing n integers (positive sequence, reverse, random distribution)