Array Algorithm - Java

Array Algorithm - Java

Java Programming

Array Editor Class
package data_structure_1; public class HighArray { private int[]arr; private int nElement; public HighArray(int max){ arr=new int [max]; nElement=0; } public void insert(int value){ arr[nElement]=value; nElement++; } public boolean find(int key){ int i; for (i=0;i<nElement;i++){ if (arr[i]==key){ break; } } if(i==nElement){ return false; }else{ return true; } } public boolean delete(int value){ int i; for (i=0;i<nElement;i++){ if (value==arr[i]){ break; } } if(i==nElement){ return false; }else{ for (int j=i;j<nElement;j++){ arr[j]=arr[j+1]; } nElement--; return false; } } public void equals(){ int sum = 0; System.out.println("Sum of all array's index value is "+nElement); for( int num : arr) { sum = sum+num; } System.out.println("Sum of all array's index value is :"+sum); } public void display(){ for (int i=0;i<nElement;i++){ System.out.print(arr[i]+" "); } System.out.println(""); } }

ArrayAPP Class for displaying, finding, deleting and find equals of all array's index value
package data_structure_1; public class HighArrayApp { public static void main(String[] args) { int maxSize = 100; HighArray arr; arr = new HighArray(maxSize); arr.insert(70); arr.insert(80); arr.insert(75); arr.insert(55); arr.insert(85); arr.insert(25); arr.insert(30); arr.insert(00); arr.insert(90); arr.insert(40); arr.display(); int key = 25; if (arr.find(key)) { System.out.println(key + " found"); } else { System.out.println(key + " not found"); } arr.delete(00); arr.delete(80); arr.delete(55); arr.display(); arr.equals(); } }