목록algorithm/study (1)
Mafa Dev
여러 정렬 알고리즘 평균 속도 , 최악의 상황 속도 , 메모리
Name 평균 최악의 상황 Memory Stable Method Bubble sort ㅡ O(n^2) O(1) Yes Exchanging Cocktail sort ㅡ O(n^2) O(1) Yes Exchanging Comb sort O(n log n) O(n log n) O(1) No Exchanging Gnome sort ㅡ O(n^2) O(1) Yes Exchanging Selection sort O(n^2) O(n^2) O(1) No Selection Insertion sort O(n + d) O(n^2) O(1) Yes Insertion Shell sort ㅡ O(n log2 n) O(1) No Insertion Binary tree sort O(n log n) O(n log n) O(n) Yes..
algorithm/study
2013. 2. 20. 01:59