Introduction - If you have any usage issues, please Google them yourself
Direct insertion method to sort the R/R Hill sorting the data table sorting, D increments the sequence number of elements n, the step sequence number numOfD Bubble sort by direct R Sort Selection Sort R sort heap sort of ordered list of a [0]- a [n-1] one-way merge sort, the length of each ordered the child table is k// a way merge sort ordered child table stored in the swap way merge sort object array a [0]- a [n-1] {sort {