Although merge sort runs in Θ(n lg n) worst-case time and insertion sort runs in Θ(n^2) worst- case time, the constant factors in insertion sort make it faster for small n. Thus, it makes sense to use insertion sort within merge sort when subproblems become sufficiently small. Consider a modification to merge sort in which n/k sublists of length k are sorted using insertion sort and then merged using the standard merging mechanism, where k is a value to be determined.
a. Show that the n/k sublists, each of length k, can be sorted by insertion sort in Θ(nk) worst-case time.
b. Show that the sublists can be merged in Θ(n lg (n/k) worst-case time.
c. Given that the modified algorithm runs in Θ(nk + n lg (n/k)) worst-case time, what is the largest asymptotic (Θnotation) value of k as a function of n for which the modified algorithm has the same asymptotic running time as standard merge sort?
d. How should k be chosen in practice?
(a) T(n) = (n/k)*Θ(k2) = Θ(nk)
(b) If there are n/k sublists, then the height of the tree formed will be lg(n/k). And at each level of the tree, the complexity of merging is Θ(n). So the worst case to merge the sublists is Θ(n lg(n/k)).
(c) Θ(nk + nlg(n/k)) = Θ(nk + nlgn - nlgk)) should be equal to Θ(nlgn)
To satisfy this, k cannot grow faster than lgn, otherwise nk term will run worse than Θ(nlgn). So k <= Θ(lgn) to satisfy the above condition.
So largest value of k = lgn.
(d) Time complexity of insertion sort = c1n2 and the time complexity of merge sort is c2nlgn.
To find the value of k
c1k2 <= c2klgk
k <= (c2/c1)lgk
Now we can check manually by putting different values of k.
Bubblesort is a popular sorting algorithm. It works by repeatedly swapping adjacent elements that are out of order.
a. 我们还需要证明数组里面的元素就是原来的那些元素
b. 每次循环前，子数组A[j..]的最小元素是A[j]
Initialization:刚开始的时候，子数组只有一个元素，是A的最后一个元素，循环不变式自然成立
Maintenance:每个迭代，会比较A[j]和A[j-1]的大小，并把小的往前放
Termination:迭代结束时，j = i,A[i]是子数组A[i..]最小的元素
c. 每次循环前，A[1,i-1]是一个排序好的数组，且小于等于A[i..]中的元素
Initialization:刚开始的时候，子数组为空，循环不变式自然成立
Maintenance:每个迭代，A[i]会变成A[i..]中的最小元素
Termination:迭代结束时，i = n, 我们获得了一个排序好的数组
d. bubblesort的最坏运行时间与insertion sort一样都是Θ(n^2)，但是一般来说bubblesort会慢点，因为它有许多的swap操作.
a. Θ(n)
b. Naive-Poly-Eval:
y = 0
for i = 0 to n
m = 1
for k = 1 to i
m = m·x
y = y + aᵢ·m
运行时间是Θ(n2),非常慢
c.
Initialization: 一开始没有项，y = 0
**Maintenance:**根据循环不变式，第i次迭代结束有
**Termination:**循环结束时 i = -1, 将i = 0代入
d. 前面已经证明了循环不变式，结论自然是成立的.
Let A[1..n] be an array of n distinct numbers. If i < j and A[i] > A[j], then the pair (i, j) is called an inversion of A.
a. List the five inversions of the array 2, 3, 8, 6, 1.
b. What array with elements from the set {1, 2, . . . , n} has the most inversions? How many does it have?
c. What is the relationship between the running time of insertion sort and the number of inversions in the input array? Justify your answer.
d. Give an algorithm that determines the number of inversions in any permutation on n elements in Θ(n lg n) worst-case time. (Hint: Modify merge sort.)
a. ⟨2,1⟩, ⟨3,1⟩, ⟨8,6⟩, ⟨8,1⟩ 和 ⟨6,1⟩.
b. The array with decending order arrangement i.e. {n, n-1, n-2, ..., 3, 2, 1} has the most inversions.
Number of inversions = Number of ways to choose two distinct element from the above set = n(n-1)/2.
c. we know that the inner while loop of insertion sort shift the elements to left to their right position. So if there is more inversion in an array, then we need to shift more elements. Hence as the number of inversions increases, running time of insertion sort increases.
d.
Follow @louis1992 on github to help finish this task.