1 Dionysis "dionyziz" Zindros >
2 In turn, each of these calls makes two calls of its own to mergeSort two arrays of size n / 4 each, and so forth until we arrive at arrays of size 1.
3 So an algorithm with Θ( n ) is of complexity n.
트위터 반응

@startup_bot: 알고리즘 복잡도 분석에 대한 소개 (A Gentle Introduction to Algorithm Complexity Analysis) http://t.co/7h3JcK6I