为什么用最小元素法和最大差值法得到的最优解不一样

为什么用最小元素法和最大差值法得到的最优解不一样

我做的：（其中算法中我设计的是模板类，不想那么复杂所以主函数中就直接用集合inta[10]={2,5,3,9,7,6,0,1,4,8}了）直接法：#include"stdafx.h"#includetemplateclassSortableList{private:T*l;intmaxSize,n;public:SortableList(intmSize){maxSize=mSize;l=newT[maxSize];n=0;}~SortableList(){delete[]l;}voidMaxMin(T&max,T&min)const;intinit(Ta[],intnSize){if(nSizevoidSortableList::MaxMin(T&max,T&min)const{inti;if(n==0)return;max=min=l[0];for(i=1;imax)max=l[i];elseif(l[i]alist(10);inta[10]={2,5,3,9,7,6,0,1,4,8};coutclassSortableList{private:T*l;intmaxSize,n;public:SortableList(intmSize){maxSize=mSize;l=newT[maxSize];n=0;}~SortableList(){delete[]l;}voidMaxMin(inti,intj,T&max,T&minn)const;intinit(Ta[],intnSize){if(nSizevoidSortableList::MaxMin(inti,intj,T&max,T&min)const{Tmin1,max1;if(i==j)max=min=l[i];elseif(i==j-1){if(l[i]min1)min=min1;}}intmain(){inti,amax,amin;SortableListalist(10);inta[10]={2,5,3,9,7,6,0,1,4,8};cout<<"元素集合为：";for(i=0;i<10;i++)cout<