hopping using greedy approach

hopgreedy.c

#include<stdio.h>
int main()
{
 	int arr[] = {1, 3, 5, 8, 9, 1,1,2, 6, 7, 6, 8};
 	int n = sizeof(arr)/sizeof(int);
	int i,j,step=0,jump=0,choice,max,val;
	
	for(i=0;i<n;)
	{
		choice = arr[i];
		max = 0;
		while(choice)
		{	
			if((i+choice)>(n-1)){--choice;continue;}
			val = arr[i+choice];
			if(val >max){max = val;step = choice;}
			choice--;
		}
		if(arr[i]+i>=n){
		jump++;
		break;	
		}
		
		jump++;
	
		i = i+step;
	}

	printf("%d",jump);
	return 0;
}