算法基础------算法导论第三章

最新推荐文章于 2024-10-15 19:28:18 发布

silent碎月

最新推荐文章于 2024-10-15 19:28:18 发布

阅读量98

点赞数

分类专栏：算法文章标签：算法

本文链接：https://blog.csdn.net/Nexas/article/details/116062526

版权

算法专栏收录该内容

7 篇文章 0 订阅

订阅专栏

二分查找

伪代码如下：

Type Search(array, val, low, high)
{
	if(low > high)
		return nil;
	mid = (low + high)  / 2;
	if(val == A.mid)
		return mid;
	if (val < A.mid)
		return Search(array, val, low, mid - 1);
	else
		return Search(array, val, mid+ 1, high);
}

霍纳（Horner）规则

常用于对一元n次方程求值

y = 0;
for i = n downto 0
	y = a[i]  + x * y

逆序对（inversion）

若i < j 且A[i] > A[j], 则对偶(i, j) 称为A的一对逆序对
确定n个元素中的任何排列中逆序对的算法，且复杂度为O(nlgn)

COUNT-INVERSIONS(A, p, r)
    if p < r
        q = floor((p + r) / 2)
        left = COUNT-INVERSIONS(A, p, q)
        right = COUNT-INVERSIONS(A, q + 1, r)
        inversions = MERGE-INVERSIONS(A, p, q, r) + left + right
        return inversions

MERGE-INVERSIONS(A, p, q, r)
    n1 = q - p + 1
    n2 = r - q
    let L[1..n1 + 1] and R[1..n2 + 1] be new arrays
    for i = 1 to n1
        L[i] = A[p + i - 1]
    for j = 1 to n2
        R[j] = A[q + j]
    L[n1 + 1] = ∞
    R[n2 + 1] = ∞
    i = 1
    j = 1
    inversions = 0
    for k = p to r
        if L[i] <= R[j]
            A[k] = L[i]
            i = i + 1
        else
            inversions = inversions + n1 - i + 1
            A[k] = R[j]
            j = j + 1
    return inversions