Chapter-3 分治策略-习题精选.pptVIP

分析 南京理工大学 习题6.5 给出在一个整数数组A[1…n]中求出所有元素和的分治算法。 输入：n个元素的数组A[1…n] 输出：数组A[1…n] 总所有元素之和 ArraySum(A,1,n) 过程ArraySum(A,low,high) if high – low = 0 return A[low] 2. if high – low 0 mid ← ?( low+high)/2? return ArraySum(A,low,mid)+ArraySum(A,mid+1,high) end if public static int arraySum(int []A,int low,int high){ if(high - low == 0) return A[low]; else if(high - low 0){ int mid = (int)Math.floor((high+low)/2); return arraySum(A,low,mid)+arraySum(A,mid+1,high); }else return Integer.MIN_VALUE; } public static void main(String []args){ int []A={1,2,3,4,5}; int result = arraySum(A,1,2); System.out.println(result); } 习题6.6 整数数组A[1…n]，x为一整数。给出一个分治算法，找出x在A中出现的频度。 输入：整数数组A[1…n]，整数x 输出：x在数组A[1…n]中出现的频度 Frequence(A,1,n,x) 过程Frequence (A,low,high,x) if high – low = 0 if A[low] = x return 1 else return 0; end if if high – low 0 mid ← ?( low+high)/2? return Frequence(A,low,mid,x)+Frequence(A,low+1,high,x) end if public static int frequence(int []A,int low, int high,int x){ if (high - low 0 ) return -1; else{ if(high - low == 0 ){ if (A[low]==x) return 1; else return 0; }else{ int mid = (int)Math.floor((high+low)/2); return frequence(A,low,mid,x)+frequence(A,mid+1,high,x); } } } public static void main(String []args){ int []A={7, 5 ,3,2,4,6,7,3,5,7,8}; int result = frequence(A,0,A.length-1,2); System.out.println(result); } Algorithm: MERGESORT(A[low…high]) 输入：待排序数组A[low,...high] 输出：A[low…high]按非降序排列 if lowhigh then if (high – low + 1 = m) then INSERTSORT(A,low,high) 3. else 4. mid←?(low+high)/2? 5. MERGESORT(A, low, mid) 6. MERGESORT(A, mid+1, high) 7. MERGE(A, low, mid, high) 8.