算法中的证明

什么是算法?

An algorithm is a collection of precisely defined steps that are executable using certain specified mechanical methods

算法为什么需要证明?

文字描述无法体现出该算法不会进入无限循环
文字描述无法体现出该算法不会因为极大的输入值而需要很长时间得出结果
文字描述无法体现出该算法能否得出正确结果

例子:

		归并排序（MERGE-SORT）是利用归并的思想实现的排序方法，该算法采用经典的分治（divide-and-conquer）策略
	   （分治法将问题分(divide)成一些小的问题然后递归求解，而治(conquer)的阶段则将分的阶段得到的各答案"修补"在一起，即分而治之)。
	   ![在这里插入图片描述](https://img-blog.csdnimg.cn/20200606090134552.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3R3ZW50eWZvdXI0ZXZlcg==,size_16,color_FFFFFF,t_70)

	
代码:

import java.util.Arrays;

public class MergeSort {

public static void merge(int[] a,int low,int mid,int high) {
	
	int[] temp = new int[high - low + 1];
    int i = low;// 左指针
    int j = mid + 1;// 右指针
    int k = 0;
    // 把较小的数先移到新数组中
    while (i <= mid && j <= high) {
        if (a[i] < a[j]) {
            temp[k++] = a[i++];
        } else {
            temp[k++] = a[j++];
        }
    }
    // 把左边剩余的数移入数组
    while (i <= mid) {
        temp[k++] = a[i++];
    }
    // 把右边边剩余的数移入数组
    while (j <= high) {
        temp[k++] = a[j++];
    }
    // 把新数组中的数覆盖nums数组
    for (int k2 = 0; k2 < temp.length; k2++) {
        a[k2 + low] = temp[k2];
    }
	
}

public static void mergeSort(int[] a, int low, int high) {
    int mid = (low + high) / 2;
    if (low < high) {
        // 左边
        mergeSort(a, low, mid);
        // 右边
        mergeSort(a, mid + 1, high);
        // 左右归并
        merge(a, low, mid, high);
        System.out.println(Arrays.toString(a));
    }

}

public static void main(String[] args) {
	int[] nums = { 10,5,2,12,0,6 };
	mergeSort(nums, 0, nums.length-1);
}
}

时间复杂度 nlongn

算法证明:

类似数学归纳法
the depth of recursion in merge-sort is logN
on each level of recursion merging intermediate arrays takes O(n)
Thus, MergeSort always terminates and, in fact, it terminates in O(nlogn) many steps.
Merging two sorted arrays always produces a sorted array,thus the output of MergeSort will be a sorted array.