package array;
import java.util.Arrays;
import java.util.Scanner;
public class Arraytry {
public static void main(String[] args) {
Arraytry at= new Arraytry();
//at.length_of_array();
//at.different_way_to_print_array();
//at.sum_of_array();
//at.average_of_array();
//at.count_of_odd_even_number();
//at.count_of_positive_negative_zero();
//at.seperate_array();
//at.seperate_even_odd();
//at.number_greater_than_given_number();
//at.number_greater_than_average();
//at.sum_of_two_array();
//at.compare_two_array();
//at.compare();
//at.copy_array_in_another_array();
//at.merge_two_array();
//at.repeate_element_count();
//at.trying();
//at.largest_number();
//at.small_number();
//at.reverse_order();
//at.linear_search();
//at.second_largest_number();
//at.second_smallest_number();
//at.sorting_ascending_number();
//at.odd_index_and_even_index();
//at.Remove_number_from_given_number();
//at.Sum_of_two_array_different_length();
//at.prime_number();
//at.print_odd_element_at_even_index();
//at.print_even_element_at_odd_index();
//at.count_of_given_number();
//at.placing_given_in_last_index();
//at.Remove_duplicate_and_new_array();
//at.gcd_using_array();
//at.add_two_element_and_insert_last();
//at.binary_search();
at.insert_element_in_array_at_specific_position();
}
private void insert_element_in_array_at_specific_position() {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr1=new int[n];
int[] arr2=new int[arr1.length+1];
System.out.println("enter array values: ");
for(int i=0;i<arr1.length;i++) {
arr1[i]=sc.nextInt();
}
System.out.println("insert value");
int given=sc.nextInt();
System.out.println("enter position");
int position=sc.nextInt();
for(int i=0,j=0;i<arr2.length;i++) {
if(i==position) {
arr2[i]=given;
}
else {
arr2[i]=arr1[j++];
}
}
System.out.println(Arrays.toString(arr2));
}
private void binary_search() {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("enter array length:" );
int n= sc.nextInt();
int[] arr=new int[n];
System.out.println("enter array values: ");
for(int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
System.out.println("enter search element:");
int key=sc.nextInt();
int s=0,e=arr.length-1;
while(true) {
int mid=(s+e)/2;
if(key==arr[mid]) {
System.out.println("yes,it contain ");
break;
}
else if(key>arr[mid]) {
s=mid+1;
}
else {
e=mid-1;
}}
}
private void add_two_element_and_insert_last() {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr1=new int[n];
int[] arr2=new int[arr1.length+1];
System.out.println("enter array values: ");
for(int i=0;i<arr1.length;i++) {
arr1[i]=sc.nextInt();
}
int sum=0;
for(int i=0;i<arr1.length;i++) {
sum+=arr1[i];
}
System.out.println("sum is: "+sum);
int i=0;
for(;i<arr2.length-1;i++) {
arr2[i]=arr1[i];
}
arr2[arr2.length-1]=sum;
System.out.println(Arrays.toString(arr2));
}
private void gcd_using_array() {
// TODO Auto-generated method stub
//int num1 = 12;
//int num2 = 8;
Scanner sc=new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr=new int[n];
System.out.println("enter array values: ");
for(int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
int gcd = 0;
for(int i=0;i<arr.length;i++) {
for(int j=i+1;j<arr.length-1;j++) {
for(int i1=1; i1 <= arr[i] && i1 <= arr[j]; i1++) {
if(arr[i] % i1 == 0 && arr[j] % i1 == 0) {
gcd = i1;
}
}}}
System.out.println(gcd);
//System.out.println("GCD of " + arr[i] + " and " + num2 + " is: " + gcd);
}
private void Remove_duplicate_and_new_array() {
// TODO Auto-generated method stub
int[] arr={10,5,3,10,10,5,22,5,44,8,6,8,7,8,9,8};
//int[] arr= {1,3,2,3,4,5,4};
int count=0;
for(int i=0;i<arr.length;i++) {//i=10
for(int j=i+1;j<arr.length;j++) {//j=5,3,10,......
if((arr[i]==arr[j])) {//10=5-false,10=3-false,10=10-true it takes that count then break,10=10 -true again take count.
System.out.println(arr[i]);
count++;
break;
}}}
int temp=0;
for(int i=0;i<arr.length;i++) {
for(int j=i+1;j<arr.length;j++) {
if(arr[i]>arr[j]) {//1>3
temp=arr[i];//temp=1
arr[i]=arr[j];//arr[i]=3
arr[j]=temp;//arr[j]=1
}
}
//System.out.println(arr[i]);
}//{1,2,2 1!=2,2!=2
System.out.println("before array "+Arrays.toString(arr));
int j=0;
int[] arr1=new int[arr.length-count];
for(int i=0;i<arr.length-1;i++) {
if(arr[i]!=arr[i+1]) {//1!=2,2!=2 false
arr1[j++]=arr[i];//arr1=1
}
//arr[j++]=arr.length-1;
}
arr1[j++]=arr[arr.length-1];//5
System.out.println("after array "+Arrays.toString(arr1));
}
private void placing_given_in_last_index() {
// TODO Auto-generated method stub
Scanner sc= new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr=new int[n];
System.out.println("enter array values : " );
for( int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();}
System.out.println("enter element: ");
int given=sc.nextInt();
for(int i=0;i<arr.length-1;i++) {
//System.out.println(arr[i]);
}
arr[arr.length-1]=given;
for(int i=0;i<arr.length;i++) {
System.out.println(arr[i]);
}
}
private void count_of_given_number() {
// TODO Auto-generated method stub
Scanner sc= new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr=new int[n];
System.out.println("enter array values : " );
for( int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();}
int count=0;
System.out.println("enter a number: ");
int given=sc.nextInt();
for(int i=0;i<arr.length;i++) {
if(arr[i]==given) {
count++;
}
}System.out.println("count is: "+count);
}
private void print_even_element_at_odd_index() {
// TODO Auto-generated method stub
Scanner sc= new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr=new int[n];
int i=0;
System.out.println("enter array values : " );
for( i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
for( i=1;i<arr.length;i+=2) {
if(arr[i]%2==0) {
System.out.println(arr[i]);
}
}
}
private void print_odd_element_at_even_index() {
// TODO Auto-generated method stub
Scanner sc= new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr=new int[n];
int i=0;
System.out.println("enter array values : " );
for( i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
for( i=0;i<arr.length;i+=2) {
if(arr[i]%2!=0) {
System.out.println(arr[i]);
}
}
}
private void prime_number() {
// TODO Auto-generated method stub
Scanner in =new Scanner(System.in);
System.out.println("enter array length: ");
int n= in.nextInt();
int[] array = new int [n];
System.out.println("Enter the elements of the array: ");
for(int i=0; i<n; i++)
{
array[i] = in.nextInt();//7,4
}
//loop through the numbers one by one
for(int i=0; i<array.length; i++){
boolean isPrime = true;
//check to see if the numbers are prime
for (int j=2; j<array[i]; j++){//0<7
if(array[i]%j==0){//7/2,7/3.....7/6,4/2=2
isPrime = false;//
break;
}
}
//print the number
if(isPrime)//7
System.out.println(array[i] + " are the prime numbers in the array ");
}
}
private void Sum_of_two_array_different_length() {
// TODO Auto-generated method stub
int[] s1 = {78, 70, 65, 45, 56};
int[] s2 = {100,97, 67, 69,90, 78};
// Ternary Operator
int big = s1.length>s2.length? s1.length: s2.length;
int small = s1.length<s2.length? s1.length: s2.length;
int[] result = new int[big];
int i=0;
for(i=0; i<small; i++)
{
result[i] = s1[i] + s2[i];
}
result[i] = s2[big-1];
for(i=0; i<result.length; i++)
{
System.out.print(result[i] + " ");}
}
private void Remove_number_from_given_number() {
// TODO Auto-generated method stub
/*Scanner sc=new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr=new int[n];
System.out.println("enter array values: ");
for(int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
System.out.println("enter remove number: ");
int key=sc.nextInt();
int[] arr_new= new int[arr.length-1];
for(int i=0,j=0;i<arr.length;i++,j++) {
if(arr[i]!=key) {
arr_new[j]=arr[i];
}
}
System.out.println("the value is "+Arrays.toString(arr_new));*/
int[] originalArray = {1, 2, 3, 4, 5};
int elementToRemove = 3;
//int newArraySize = originalArray.length - 1;
//int[] newArray = new int[newArraySize];
int[] newArray = new int[originalArray.length - 1];
//int j = 0;
for (int i = 0,j=0; i < originalArray.length; i++) {
if (originalArray[i] != elementToRemove) {//1!=3,3==3
newArray[j] = originalArray[i];//1
j++;
}
}
System.out.println(Arrays.toString(newArray));
int[] arr1= {1,2,3,4,5};
int[] arr2=new int[arr1.length-2];
for(int i=0,j=0;i<arr1.length;i++) {
if(i!=0 && i!=arr1.length-1) {
arr2[j]=arr1[i];
j++;
}
}System.out.println(Arrays.toString(arr2));
}
private void odd_index_and_even_index() {
// TODO Auto-generated method stub
Scanner sc =new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr=new int[n];
System.out.println("enter array values: ");
for(int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
for(int i=0;i<arr.length;i+=2) {//0,0+2=2-->even
System.out.println("even length value is arr["+i+"] "+arr[i]);
}
for(int i=1;i<arr.length;i+=2) {//1,1+2=3-->odd
System.out.println("odd length value is arr["+i+"] "+arr[i]);
}
}
private void sorting_ascending_number() {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("enter array length: ");
int n= sc.nextInt();
int[] arr=new int[n];
//int[] brr=new int[n];
System.out.println("enter array values: ");
for(int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
int temp=0;
for(int i=0;i<arr.length;i++) {
for(int j=i+1;j<arr.length;j++) {
if(arr[i]>arr[j]) {
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
System.out.println(arr[i]);
}
System.out.println(Arrays.toString(arr));
/*int a[]={1,278,3,94,5,57,5,67,};
int temp=0;
for(int i=0;i<a.length;i++)
{
for(int j=i+1;j<a.length;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
System.out.print(a[i]+" ");
}System.out.println(Arrays.toString(a));*/
}
private void second_smallest_number() {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("enter array length: ");
int n =sc.nextInt();
int[] arr=new int[n];
System.out.println("enter array values: ");
for(int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
int min=arr[0];
int small=0;
for(int i=0;i<arr.length;i++) {
if(arr[i]<min) {
small=min;
min=arr[i];
}
else if(arr[i]<small) {
small=arr[i];
}
}
System.out.println("first smallest is "+min);
System.out.println("second smallest is "+small);
}
private void second_largest_number() {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr=new int[n];
System.out.println("enter array values: ");
for(int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
int small=0,max=arr[0];
for(int i=1;i<arr.length;i++) {
if(arr[i]>max) {//30>10-true,20>30-false
small=max;//10
max=arr[i];//30
}
else if(arr[i]>small) {//20>10
small=arr[i];//20
}
}
System.out.println("largest number is: "+max);//30
System.out.println("second largest number is: "+small);//20
}
private void linear_search() {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr=new int[n];
System.out.println("enter array values: ");
for(int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
System.out.println("enter search element: ");
int given=sc.nextInt();
for(int i=0;i<arr.length;i++) {
if(arr[i]==given) {
System.out.println(given+" is contain in "+i+" index");
}
else {
System.out.println("not");
}
}
}
private void reverse_order() {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr=new int[n];
int[] arr2=new int[arr.length];
System.out.println("array value: ");
for(int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
for(int i=0,j=arr.length-1;i<arr.length;i++,j--) {
arr2[j]=arr[i];//arr2[4]=arr[0]
//System.out.println(arr[i]);
}
System.out.println(Arrays.toString(arr2));
}
private void small_number() {
// TODO Auto-generated method stub
int[] arr= {1,2,3,4,5,-6,-9,-2};
int min=arr[0];
for(int i=0;i<arr.length;i++) {
if(min>arr[i]) {//1>2,2>3
//System.out.println(arr[i]);
min=arr[i];
//System.out.println(arr[i]);
}
}
System.out.println(min);
}
private void largest_number() {
// TODO Auto-generated method stub
int[] arr= {1,2,3,4,5};
int max=arr[0];
for(int i=0;i<arr.length;i++) {
if(arr[i]>max) {//1>1,2>1
//System.out.println(arr[i]);
max=arr[i];//max=2
}
}
System.out.println(max);
}
private void trying() {
// TODO Auto-generated method stub
int[] my_array = {1, 2, 5, 5, 6, 6, 7, 2};
int count=0;
for (int i = 0; i < my_array.length-1; i++)
{
for (int j = i+1; j < my_array.length; j++)
{
if ((my_array[i] == my_array[j]) && (i != j))
{
System.out.println("Duplicate Element : "+my_array[j]);
count++;
}
}
}
System.out.println("count is"+count);
}
private void repeate_element_count() {
// TODO Auto-generated method stub
int[] arr={10,5,3,10,10,5,22,5,44,8,6,8,7,8,9,8};
int count=0;
for(int i=0;i<arr.length;i++) {//i=10
for(int j=i+1;j<arr.length;j++) {//j=5,3,10,......
if((arr[i]==arr[j])) {//10=5-false,10=3-false,10=10-true it takes that count then break,10=10 -true again take count.
System.out.println(arr[i]);
count++;
break;
}
else {
//System.out.println("no");
}
}
}
System.out.println("count is"+count);
}
private void merge_two_array() {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr1=new int[n];
int[] arr2=new int[n];
int[] arr3=new int[arr1.length+arr2.length];//if it merge array, length is increase,so it added two array length for put the third array length
System.out.println("enter array1 value: ");
for(int i=0;i<arr1.length;i++) {
arr1[i]=sc.nextInt();
}
System.out.println("enter array2 value: ");
for(int i=0;i<arr2.length;i++) {
arr2[i]=sc.nextInt();
}
for(int i=0;i<arr1.length;i++) {//i=0to4 it fill index 0 to 4
arr3[i]=arr1[i];//arr3[0]=arr1[0]
}
for(int i=0,j=arr1.length;j<arr1.length+arr2.length;i++,j++) {//j=5,5<(5+5=10),it already assign 0 to 4 index in above loop ,so it assign j is arr1 or arr2 length,that assign index 5 to 9.the condition j is failed loop is stopped,it not depend upon i.
arr3[j]=arr2[i];//arr3[5]=arr2[0]
}
System.out.println(Arrays.toString(arr3));
}
private void copy_array_in_another_array() {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr1= new int[n];
System.out.println("enter array values: ");
for(int i=0;i<arr1.length;i++) {
arr1[i]=sc.nextInt();
}
int[] arr2=new int[arr1.length];
for(int i=0;i<arr2.length;i++) {
arr2[i]=arr1[i];
System.out.println(arr2[i]);
}
System.out.println(Arrays.toString(arr2));
}
private void compare() {
// TODO Auto-generated method stub
int[] arr1= {1,2,3,4,5};
int[] arr2= {1,2,3,4,5};
int[] arr3= {2,3,4,7,8};
if(arr2.equals(arr1)) {
System.out.println("same");
}
else {
System.out.println("not same");
}
}
private void compare_two_array() {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr1=new int[n];
int[] arr2=new int[n];
System.out.println("enter array1 value: ");
for(int i=0;i<arr1.length;i++) {
arr1[i]=sc.nextInt();
}
System.out.println("enter array2 value: ");
for(int i=0;i<arr2.length;i++) {
arr2[i]=sc.nextInt();
}
for(int i=0;i<arr1.length;i++) {
if(Arrays.equals(arr1, arr2)) {
System.out.println("arrays are same");
//System.out.println(i+" index is same");
}
else {
System.out.println("array not same");
//System.out.println(i+" index is not same");
}
}
}
private void sum_of_two_array() {
// TODO Auto-generated method stub
Scanner sc= new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr1=new int[n];
int[] arr2=new int[n];
System.out.println("enter array1 values: ");
for(int i=0;i<arr1.length;i++) {
arr1[i]=sc.nextInt();
}
System.out.println("enter array2 values: ");
for(int i=0;i<arr2.length;i++) {
arr2[i]=sc.nextInt();
}
int[] arr3 = new int[n];
for(int i=0;i<arr3.length;i++) {
arr3[i]=arr1[i]+arr2[i];
//System.out.println("value of arr3["+i+"] is "+arr3[i]);
}
System.out.println("value of arr3 is "+Arrays.toString(arr3));
}
private void number_greater_than_average() {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr=new int[n];
System.out.println("enter array values: ");
for(int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
int sum=0,average=0;
for(int i=0;i<arr.length;i++) {
sum+= arr[i];
}
average=sum/arr.length;
System.out.println("the average is:"+average);
for(int i=0;i<arr.length;i++) {
if(arr[i]>average) {
System.out.println("the values are: "+arr[i]);
}
}
}
private void number_greater_than_given_number() {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
System.out.println("enter array length: ");
int n=sc.nextInt();
int[] arr=new int[n];
System.out.println("enter array values: ");
for(int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
System.out.println("enter number: ");
int given=sc.nextInt();
for(int i=0;i<arr.length;i++) {
if(arr[i]>given) {
System.out.println("the value is: "+arr[i]);
}
}
}
private void seperate_even_odd() {
// TODO Auto-generated method stub
int evennum=0,oddnum=0;
Scanner sc=new Scanner(System.in);
System.out.println("Enter the limit");
int n=sc.nextInt();
int[] a=new int[n];
for(int i=0; i<a.length; i++)
{
System.out.println("Enter the a["+i+"] values");
a[i]=sc.nextInt();
}
for(int element : a)
{
if(element%2==0)
{
evennum++;
}
else
{
oddnum++;
}
}
int evenarray[]=new int[evennum];
int oddarray[]=new int[oddnum];
int even=0,odd=0;
for(int element:a)
{
if(element%2==0)
{
evenarray[even++]=element;
}
else
{
oddarray[odd++]=element;
}
}
System.out.println("even number is" + Arrays.toString(evenarray));
System.out.println("odd number is" + Arrays.toString(oddarray));
}
private void seperate_array() {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
System.out.println("enter array length: ");
int a =sc.nextInt();
int[] arr=new int[a];
System.out.println("enter array values: ");
for(int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
int positive=0,negative=0,positive2=0,negative2=0;
for(int i=0;i<arr.length;i++) {
if(arr[i]>0) {
positive++;
}
else if(arr[i]<0) {
negative++;
}
}
int[] positive1=new int[positive];
int[] negative1=new int[negative];
for(int i=0;i<arr.length;i++) {
if(arr[i]>0) {
positive1[positive2++]=arr[i];
}
else if(arr[i]<0) {
negative1[negative2++]=arr[i];
}
}
System.out.println("Positive is "+Arrays.toString(positive1));
System.out.println("Negative is "+Arrays.toString(negative1));
}
private void count_of_positive_negative_zero() {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
System.out.println("enter array length: ");
int a= sc.nextInt();
int[] arr=new int[a];
System.out.println("enter array values: ");
for(int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
int positive=0,negative=0,zeros=0,sum_pos=0,sum_neg=0;
for(int i=0;i<arr.length;i++) {
if(arr[i]>0) {
System.out.println("positive number is: "+arr[i]);
sum_pos+=arr[i];
positive++;
}
else if(arr[i]<0) {
System.out.println("negative number is: "+arr[i]);
sum_neg+=arr[i];
negative++;
}
else {
System.out.println("zeros is: "+arr[i]);
zeros++;
}
}
System.out.println("positive count is: "+positive);
System.out.println("sum of positive number is "+sum_pos);
System.out.println("negative count is: "+negative);
System.out.println("sum of negative number is "+sum_neg);
System.out.println("zeros count is: "+zeros);
}
private void count_of_odd_even_number() {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("enter array length: ");
int a= sc.nextInt();
int[] arr=new int[a];
System.out.println("enter array values: ");
for(int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
}
int even=0,odd=0,odd_sum=0,even_sum=0;
for(int i=0;i<arr.length;i++) {
if(arr[i]%2==0) {
System.out.println("even number is: "+arr[i]);
even_sum+=arr[i];
even++;
}
else if(arr[i]%2!=0) {
System.out.println("odd number is: "+arr[i]);
odd_sum+=arr[i];
odd++;
}
}
System.out.println("sum of even number is: "+even_sum);
System.out.println("sum of odd number is: "+odd_sum);
System.out.println("even number count is: "+even);
System.out.println("odd number count is: "+odd);
}
private void average_of_array() {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
System.out.println("enter array length: ");
int a =sc.nextInt();
int arr[] =new int[a];
System.out.println("enter array values: ");
for(int i=0;i<arr.length;i++) {
arr[i]=sc.nextInt();
//System.out.println(arr[i]);
}
int sum=0;
int average=0;
for(int i=0;i<arr.length;i++) {
sum+=arr[i];
}
average=sum/arr.length;
System.out.println("sum of values: "+sum);
System.out.println("average of value is: "+average);
}
private void sum_of_array() {
// TODO Auto-generated method stub
int total=0;
int[] arr= {1,-2,3,-4,5};
for(int i=0;i<arr.length;i++) {
//System.out.println("arr["+i+"] = "+arr[i]);
total+=arr[i];
System.out.println(total); //cumulative sum
}System.out.println(total);
}
private void different_way_to_print_array() {
// TODO Auto-generated method stub
int[] arr= {1,2,3,4,5};
/*for(int i=0;i<arr.length;i++) {
System.out.println("arr["+i+"] = "+arr[i]);
}*/
int i=0;
while(i<arr.length) {
System.out.println("arr["+i+"] = "+arr[i]);
i++;
}
/*for( int i:arr) {
System.out.println("arr["+i+"] = "+arr[i]);
}*/
}
private void length_of_array() {
// TODO Auto-generated method stub
int[] a= {1,2,3,4,5};
System.out.println(a.length);
}
}
sankaa 
Leave a comment