Introduction - If you have any usage issues, please Google them yourself
Common internal sorting algorithms: direct insertion sort, Hill sent order, bubble sort, quick sort, simple selection sort, heap sort order for each method, recording its data comparing the number of times and data movement. Sort the data required to be not less than 100, data is distributed over a larger range, if 1000.