findNearest algorithm

This is a search algorithm but what makes it different is that it checks if the data you are looking for in the data matrix. if it is, it returns the position of it and the value at that position. if what you are searching for is not in the data matrix, the algorithm will return the closest value to what you are searching and return the value and its position inside the matrix

ex:
>>findNearest([1 2 3 4 5],3.6)
ans =
Nearest Value = 4
Position = 4

Acknowledgement:
MIT opencourseware homework assignment but no code was given just the idea.