Java Common sorting algorithm "Select, Bubble, Fast"

Select Sort:

Description: Starts with the first element of the array, and in turn contrasts with all other elements, if larger or smaller (depending on ascending or descending), the position is swapped.

Chicesort Code

Bubble Sort:

Description: Compares two adjacent elements in an array, swapping positions if the former is larger. Like bubbles in a beer cup, first float up the biggest bubbles, then float up the second largest bubble ...

Bubblesort Code

Quick sort:

Description: Look for a benchmark (the first or last of the array), the two ends of the table are scanned at the same time, small at the left, large in the right. Then recursively sort from both sides of the datum.

Quicksortcode

Java Common sorting algorithm "Select, Bubble, Fast"