Package org.plasma.common.sort

Class Summary

Class	Description
BubbleSort	Bubble sort algorithm Time Complexity: O(n*n) Memory Complexity: O(1) Stable: yes
InsertionSort	Insertion sort algorithm Time Complexity: O(n*n) Memory Complexity: O(1) Stable: yes
MergeSort	Merge sort algorithm Average Time Complexity: O(n log n) Worst Time Complexity: O(n log n) Memory Complexity: O(n) Stable: yes
OArrays
QuickSort	Quicksort algorithm Average Time Complexity: O(n log n) Worst Time Complexity: O(n*n) Memory Complexity: O(log n) Stable: no
SelectionSort	Selection sort algorithm Time Complexity: O(n*n) Memory Complexity: O(1) Stable: yes Note: Other implementations of the selection sort algorithm might not be stable.
ShellSort	Shell sort algorithm Time Complexity: O(n log2 n) Memory Complexity: O(1) Stable: no
Sort	These algorithms can be used to sort an array of any primitive datatype / Comparable Object.
Sorter	Information about each algorithm's time/memory complexity and stability is provided in their respective classes.