Sorting algorithms in Java

Trying to list down some sorting algorithms in Java:

Merge Sort:
It is a divide and conquer algorithm.
Divide the unsorted list into n sub-lists, each containing 1 element (a list of 1 element is considered sorted).

Refer Merge Sort article for details.

Bubble Sort:
Bubble sort is a simple sorting algorithm that works by:

•     Repeatedly going through the list to be sorted
•     Comparing each pair of adjacent items
•     Swapping them if they are in the wrong order

Refer Bubble Sort article for details.

Quick Sort:
Quick sort is based on the principle of divide and conquer.
Quick sort first divides the large lists into two sub smaller lists, the low elements and the high elements.
It can then recursively sort the sub-lists.

Refer Quick Sort article for details.

Insertion Sort
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time.

Refer Insertion Sort article for details.

Selection Sort:
Selection sort is a simple algorithm.
It divides the input lists into two parts:

• The sub-list of the items are already sorted, which is built up from left to right at the front(left) of the list.
• The sub-list of the  items remaining to be sorted that occupy the rest of the list.

Refer Selection Sort article for details.