Blogs

Bi-Directional Linear Array Sum Algorithm
Author:Dixanta Bahadur Shrestha

Most of us know, how linear array sum alrogithm works. For Example


int[] arr={12,34,56,78,34,56,89};
int length=arr.length;

int sum=0;
for(int i=0;i<length;i++){
	sum +=arr[i];
}

System.out.println("Total" + sum);

Above example is the traditional approach of Linear Array Sum Algorithm and can also be solved using different approach.

Bi-Directional Linear Array sum Algorithm can sum values from both direction with a bit of tweaking the traditional approach. For example


int[] arr={12,34,56,78,34,56,89};
int length=arr.length;

int sum=0;
for(int i=0;i<length;i++){
	sum +=arr[i];
            int end=length-1;

            if(i<end){
                sum +=arr[end];
                length--;
            }
 }
System.out.println("Total" + sum);


Happy coding !!!