Best, Average and Worst Case Time complexities of different Sorting Methods

Sorting Technique	Best	Average	Worst	in-place	Stable	Method
Insertion sort	n	n2	n2	Yes	Yes	Insertion
Shell Sort	n	nlog2n or n3/2	Depends	Yes	No	Insertion
Selection Sort	n2	n2	n2	Yes	No	Selection
Heap Sort	nlogn	nlogn	nlogn	Yes	No	Selection
Bubble Sort	n	n2	n2	Yes	Yes	Exchanging
Merge Sort	nlogn	nlogn	nlogn	No	Yes	Merging
Quick Sort	nlogn	nlogn	n2	Yes	Depends	Partitioning