Write a recursive function that, given an integer X, determines the position of the closest value of X in an array.
Prototype : int closest(int tab[], int N, int X, int position)
Write a main function to test your program.

---

Difficulty level

---

This exercise is mostly suitable for LEVEL 2 students

---

int closest(int tab[], int N, int X, int position)
{
	if(N<=0)
		return position;
	if( (abs(tab[N]-X)<=abs(position-X)) && N>0  )
		return closest(tab,N-1,X,tab[N]);
	return closest(tab,N-1,X,position);
}

---

Click here for more One dimensional array exercises! Click here for more Recursive function exercises! Click here for more Recursion exercises! Back to the list of exercises

---

Looking for a more challenging exercise, try this one !!
Right rotate an array

Mistakes may occur. If, while solving, you come across any mistakes with the codes, please, don't hesitate to contact me so that we may correct it together, creating a better programming community.
All proposed suggestions are most welcomed. !!!