public int Finder(int start, int end, int elementToFind)
	{
		int mid;
		
		System.out.println("start:"+start+ " "+"end:"+end);
		if(start > end)
		{
			return -1;
		}
		
		mid = (start+end)/2;
		System.out.println("mid : "+number[mid] + " " + elementToFind);
		if(number[mid] == elementToFind)
		{
			return mid;
		}
		
		if(number[start] < number[mid])
		{
			System.out.println("start is lesser than mid");
			if(elementToFind > number[mid])
			{
				return Finder(mid+1, end, elementToFind);
			}
			else if((elementToFind < number[mid])&&(elementToFind < number[start]))
			{
				return Finder(mid+1, end, elementToFind);
			}else
			{
				return Finder(start, mid-1, elementToFind);
			}
		}
		else
		{
			System.out.println("start is greater than mid");
			if(elementToFind > number[end])
			{
				return Finder(start, mid-1, elementToFind);
			}
			else if(elementToFind <= number[end])
			{
				return Finder(mid+1, end, elementToFind);
			}
				
		}
		
		return -1;
	}