Consider the following nearest neighbour problem. You are given an integer x, 
an integer N  >=1 and a sorted array of integers A(1), ...., A(N).
Assume that these numbers have already been input into some specified locations (words)
in the memory. Give a machine or assembly language program which will find 
and print out the smallest index j and value A(j) satisfying 
|A(j)-x| <= |A(k)-x| for all k, 1 <= k <= N.

You can make up any machine language instructions
that have been used in class or you may use your own machine
language instructions if
you give a short description of what each instruction does. 


Due: Monday, October 6 at start of seminar.