정렬 알고리즘 비교

Dec 11th, 2005

name	avg	max	#	비고
Bubble Sort	O(n²⁾	O(n²⁾	0
Quick Sort	O(nlogn)	O(n²⁾	O(logn)
Heap Sort	O(nlogn)	O(nlogn)	0
Radix Sort	O(wxn)	O(wxn)	O(n)	w 는 자릿수
Merge Sort	O(nlogn)	O(nlogn)	O(n)
Bitonic Sort	O(nlog²ⁿ⁾	O(nlog²ⁿ⁾	0

Comments