#include int InterpolationSearch(int A[], int n, int x){ int low =0; int high =n-1; while (low<=high){ int mid = low + (((high-1)*(x-A[low]))/(A[high]-A[low])); if(x==A[mid]) return mid; // Found x, return (exit) else if (x