贪心算法活动选择问题

public class greedy {
	private static void recursiveActivitySelector(int s[],int f[],int i,int n)
	{	int m = i;//被选中
		
		while(m<n&&s[m]<f[i])
			m = m + 1;
		if(m<n)
			{
				System.out.println(m+1+" ");recursiveActivitySelector(s,f,m,n);
			}
		else
			return;
	}
	public static void main(String [] args)
	{
		int s[]={1,3,0,5,3,5,6,8,8,2,12};
		int f[]={4,5,6,7,8,9,10,11,12,13,14};
		int i = 0;
		int m = s.length;
		System.out.println(1);
		recursiveActivitySelector(s,f,i,m);
	}

}