Algorithms

int offset = 2;
int length = 364;

float sum = 0.0f;

for(int i= offset; i<=length; i++)
{
    sum += (float) i;
}

Each iteration of the above code requires between five and six comparisons (the extra is due to the repetitions needed to distinguish the three states of < > and = via binary comparisons in the absence of a three-way comparison) plus some messy arithmetic, while the binary search algorithm can be written with one comparison per iteration and uses only trivial integer arithmetic. It would thereby search an array of a million elements with no more than twenty comparisons (involving accesses to slow memory where the array elements are stored); to beat that the interpolation search as written above would be allowed no more than three iterations.

# include<iostream>
# include<String>
using namespace std;
int main(){
 cout << "The Smallest Number on that list is: "<<  SmalList(  a ,size);

}

int SmalList(int a[], int size){

	int xsmall=a[0];

	for (int i=0; size>i; i++){
	
		if( a[i]<xsmall){
		
			xsmall=a[i];
		 
		}
	
	}
	return xsmall;
}