public class Test {
private static int getLow(int[] num,int pos){
int ipos=pos;
for(int i = 0;i<num.length;i++){
if (num[i]<num[pos]){
ipos = i;
break;
}
}
if (ipos==pos){
return pos;
}else{
return getLow(num,ipos);
}
} /**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] num = new int[]{10,5,6,34,78,0,19,1};
System.out.println(getLow(num,0)); }}
private static int getLow(int[] num,int pos){
int ipos=pos;
for(int i = 0;i<num.length;i++){
if (num[i]<num[pos]){
ipos = i;
break;
}
}
if (ipos==pos){
return pos;
}else{
return getLow(num,ipos);
}
} /**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] num = new int[]{10,5,6,34,78,0,19,1};
System.out.println(getLow(num,0)); }}
if(1==count) return (n[0]>n[count]?count:0);
return ( n[MinD(n, count--)]>n[count]?count:MinD(n, count--));
}int minIndex=MinD(n,n.length);
public class Hello
{
private static int index=-1;
public static void main(String [] args)
{
int[] n = {2,3,5,7,9,1,4,6,8,10};
System.out.println(min(n,0,n.length-1));
}
private static int min(int [] a,int left,int right)
{
if(left==right)
return left;
else
{
int mid=(left+right)/2;
int t=min(a,left,mid);
int s=min(a,mid+1,right);
if(a[s]<a[t])
return s;
else
return t;
}
}
}
int[] n = {2,3,5,7,9,1,4,6,8,10};
int flag=0;
for(int i=0;i<n.length;i++){
flag = n[flag]>n[i]?i:flag;
}
System.out.println(flag);
}