Number of watchers on Github  2656 
Number of open issues  140 
Main language  Java 
Average time to merge a PR  1 day 
Open pull requests  38+ 
Closed pull requests  32+ 
Last commit  about 1 year ago 
Repo Created  almost 3 years ago 
Repo Last Updated  about 1 year ago 
Size  304 KB 
Organization / Author  thealgorithms 
Contributors  5 
Page Updated  20180317 
Do you use Java? Leave a review!  
View open issues (140)  
View on github  
Fresh, new opensource launches 🚀🚀🚀  
Trendy new open source projects in your inbox!
View examples

These are for demonstration purposes only. There are many implementations of sorts in the Java standard library that are much better for performance reasons.
From Wikipedia: Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.
Properties
From Wikipedia: Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
Properties
From Wikipedia: In computer science, merge sort (also commonly spelt mergesort) is an efficient, generalpurpose, comparisonbased sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945.
Properties
From Wikipedia: Quicksort (sometimes called partitionexchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order.
Properties
From Wikipedia: The algorithm divides the input list into two parts: the sublist of items already sorted, which is built up from left to right at the front (left) of the list, and the sublist of items remaining to be sorted that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.
Properties
From Wikipedia: Shellsort is a generalization of insertion sort that allows the exchange of items that are far apart. The idea is to arrange the list of elements so that, starting anywhere, considering every nth element gives a sorted list. Such a list is said to be hsorted. Equivalently, it can be thought of as h interleaved lists, each individually sorted.
Properties
Comparing the complexity of sorting algorithms (Bubble Sort, Insertion Sort, Selection Sort)
From Wikipedia: linear search or sequential search is a method for finding a target value within a list. It sequentially checks each element of the list for the target value until a match is found or until all the elements have been searched. The linear search runs in at the worst linear time and makes at most n comparisons, where n is the length of the list.
Properties
From Wikipedia: Binary search, also known as halfinterval search or logarithmic search, is a search algorithm that finds the position of a target value within a sorted array. It compares the target value to the middle element of the array; if they are unequal, the half in which the target cannot lie is eliminated and the search continues on the remaining half until it is successful.
Properties
From Wikipedia: Shellsort is a generalization of insertion sort that allows the exchange of items that are far apart. The idea is to arrange the list of elements so that, starting anywhere, considering every nth element gives a sorted list. Such a list is said to be hsorted. Equivalently, it can be thought of as h interleaved lists, each individually sorted.
Properties