Skip to content

Commit 68dd35c

Browse files
curious-vasavicurious-vasavi
committed
Add Day 09 core array programs
1 parent 5e79689 commit 68dd35c

12 files changed

+461
-0
lines changed

‎src/array_Programming/core/day_09/CopyingOfElements.java‎

Lines changed: 36 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,36 @@
1+
package array_Programming.core.day_09;
2+
3+
import java.util.Arrays;
4+
import java.util.Scanner;
5+
6+
//12. WAPT to copy all elements from one array to another array.
7+
8+
public class CopyingOfElements
9+
{
10+
public static int[] copyArray(int [] original)
11+
{
12+
int [] copy = new int [original.length];
13+
for(int i = 0;i<original.length;i++)
14+
{
15+
copy[i] = original[i];
16+
}
17+
return copy;
18+
}
19+
public static void main(String[] args) {
20+
Scanner sc = new Scanner(System.in);
21+
System.out.println("Enter the size of the array : ");
22+
int size = sc.nextInt();
23+
int [] arr = new int [size];
24+
System.out.println("Enter "+ size +" elements :");
25+
for(int i = 0 ;i<= arr.length-1;i++)
26+
{
27+
arr[i] = sc.nextInt();
28+
}
29+
System.out.println(Arrays.toString(arr));
30+
int [] arr2 = copyArray(arr);
31+
System.out.println("Original Array : " + Arrays.toString(arr));
32+
System.out.println("Copied Array : " + Arrays.toString(arr2));
33+
34+
sc.close();
35+
}
36+
}

‎src/array_Programming/core/day_09/CountElements.java‎

Lines changed: 36 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,36 @@
1+
package array_Programming.core.day_09;
2+
3+
import java.util.Arrays;
4+
import java.util.Scanner;
5+
//2. WAPT to count the No. of elements in an array.
6+
7+
public class CountElements
8+
{
9+
public static int count(int arr[])
10+
{
11+
int count = 0;
12+
for(int i = 0;i<=arr.length-1;i++)
13+
{
14+
count++;
15+
}
16+
return count;
17+
}
18+
public static void main(String[] args)
19+
{
20+
Scanner sc = new Scanner(System.in);
21+
// with no predefined input
22+
// System.out.println("Enter the size of the array : ");
23+
// int size = sc.nextInt();
24+
// System.out.println("Enter "+size + " elements :");
25+
// int [] arr = new int [size];
26+
// for(int i = 0 ;i<=arr.length-1;i++)
27+
// {
28+
// arr[i] = sc.nextInt();
29+
// }
30+
int [] arr = {1,2,3,4,5,6,7,8};
31+
System.out.println(Arrays.toString(arr));
32+
int result = count(arr);
33+
System.out.println("The count of the elements in the array is : " + result);
34+
sc.close();
35+
}
36+
}

‎src/array_Programming/core/day_09/DuplicateElements.java‎

Lines changed: 51 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,51 @@
1+
package array_Programming.core.day_09;
2+
3+
import java.util.Scanner;
4+
5+
// 6. WAPT Print all duplicate elements in an array.
6+
public class DuplicateElements {
7+
8+
public static void duplicate(int[] arr) {
9+
10+
System.out.println("Duplicate elements are :");
11+
12+
for (int i = 0; i < arr.length; i++) {
13+
14+
boolean alreadyPrinted = false;
15+
16+
for (int k = 0; k < i; k++) {
17+
if (arr[i] == arr[k]) {
18+
alreadyPrinted = true;
19+
break;
20+
}
21+
}
22+
23+
if (alreadyPrinted)
24+
continue;
25+
26+
for (int j = i + 1; j < arr.length; j++) {
27+
if (arr[i] == arr[j]) {
28+
System.out.println(arr[i]);
29+
break;
30+
}
31+
}
32+
}
33+
}
34+
35+
public static void main(String[] args) {
36+
Scanner sc = new Scanner(System.in);
37+
38+
System.out.println("Enter the size of the array : ");
39+
int size = sc.nextInt();
40+
41+
int[] arr = new int[size];
42+
43+
System.out.println("Enter " + size + " elements :");
44+
for (int i = 0; i < arr.length; i++) {
45+
arr[i] = sc.nextInt();
46+
}
47+
48+
duplicate(arr);
49+
sc.close();
50+
}
51+
}

‎src/array_Programming/core/day_09/EvenIndices.java‎

Lines changed: 30 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,30 @@
1+
package array_Programming.core.day_09;
2+
3+
import java.util.Scanner;
4+
5+
//4. WAPT Print all elements at even indices in an array.
6+
7+
public class EvenIndices
8+
{
9+
public static void evenIndices(int [] arr)
10+
{
11+
System.out.println("Elements at even indices are : ");
12+
for(int j = 0;j<=arr.length-1;j=j+2)
13+
{
14+
System.out.println(arr[j]);
15+
}
16+
}
17+
public static void main(String[] args) {
18+
Scanner sc = new Scanner(System.in);
19+
System.out.println("Enter the size of the array : ");
20+
int size = sc.nextInt();
21+
int [] arr = new int[size];
22+
System.out.println("Enter "+ size + " elements :");
23+
for(int i = 0 ;i<= arr.length-1;i++)
24+
{
25+
arr[i] = sc.nextInt();
26+
}
27+
evenIndices(arr);
28+
sc.close();
29+
}
30+
}

‎src/array_Programming/core/day_09/FrequencyOfElements.java‎

Lines changed: 42 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
1+
package array_Programming.core.day_09;
2+
3+
import java.util.Arrays;
4+
import java.util.Scanner;
5+
6+
//11. WAPT Find the frequency of each element in an array.
7+
public class FrequencyOfElements
8+
{
9+
public static void frequency(int [] arr)
10+
{
11+
int visited = Integer.MIN_VALUE;
12+
for(int i = 0;i<=arr.length-1;i++)
13+
{
14+
if(arr[i] == visited)
15+
continue;
16+
int count = 1;
17+
for(int j = i+1;j<arr.length;j++)
18+
{
19+
if(arr[i] == arr[j])
20+
{
21+
count++;
22+
arr[j] = visited;
23+
}
24+
}
25+
System.out.println("Element " + arr[i] + " -> Frequency " + count);
26+
}
27+
}
28+
public static void main(String[] args) {
29+
Scanner sc = new Scanner(System.in);
30+
System.out.println("Enter the size of array : ");
31+
int size = sc.nextInt();
32+
int [] arr = new int[size];
33+
System.out.println("Enter " + size + " elements :");
34+
for(int i = 0;i<=arr.length-1;i++)
35+
{
36+
arr[i] = sc.nextInt();
37+
}
38+
System.out.println(Arrays.toString(arr));
39+
frequency(arr);
40+
sc.close();
41+
}
42+
}

‎src/array_Programming/core/day_09/LargestElement.java‎

Lines changed: 39 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
package array_Programming.core.day_09;
2+
3+
import java.util.Arrays;
4+
import java.util.Scanner;
5+
6+
//9. WAPT Print the largest element in a given array.
7+
8+
public class LargestElement
9+
{
10+
public static int largestElement(int [] arr)
11+
{
12+
int largest = arr[0];
13+
for(int i = 0;i<=arr.length-1;i++)
14+
{
15+
if(arr[i]>largest)
16+
{
17+
largest = arr[i];
18+
}
19+
}
20+
System.out.println("The largest element in the array is " + largest);
21+
return largest;
22+
}
23+
public static void main(String[] args) {
24+
Scanner sc = new Scanner(System.in);
25+
System.out.println("Enter size of the array : ");
26+
int size = sc.nextInt();
27+
int [] arr = new int[size];
28+
System.out.println("Enter " + size + " elements : ");
29+
for(int i = 0;i<=arr.length-1;i++)
30+
{
31+
arr[i] = sc.nextInt();
32+
}
33+
System.out.println(Arrays.toString(arr));
34+
largestElement(arr);
35+
sc.close();
36+
37+
}
38+
39+
}

‎src/array_Programming/core/day_09/MergeArray.java‎

Lines changed: 52 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,52 @@
1+
package array_Programming.core.day_09;
2+
3+
import java.util.Arrays;
4+
import java.util.Scanner;
5+
6+
//8. WAPT Merge two arrays.
7+
8+
public class MergeArray
9+
{
10+
public static int [] mergeArray(int [] arr1, int [] arr2)
11+
{
12+
int [] merged = new int[arr1.length + arr2.length];
13+
int index = 0;
14+
for(int i = 0;i<arr1.length;i++)
15+
{
16+
merged[index++] = arr1[i];
17+
}
18+
for(int i = 0;i<arr2.length;i++)
19+
{
20+
merged[index++] = arr2[i];
21+
}
22+
return merged;
23+
}
24+
public static void main(String[] args) {
25+
Scanner sc = new Scanner(System.in);
26+
27+
System.out.println("Enter size of first array : ");
28+
int size = sc.nextInt();
29+
int [] arr1 = new int[size];
30+
31+
System.out.println("Enter "+ size + " elements of first array :");
32+
for(int i = 0;i<arr1.length;i++)
33+
{
34+
arr1[i] = sc.nextInt();
35+
}
36+
37+
System.out.println("Enter size of second array : ");
38+
int size2 = sc.nextInt();
39+
int [] arr2 = new int[size2];
40+
41+
System.out.println("Enter "+ size2 + " elements of second array :");
42+
for(int i = 0;i<arr2.length;i++)
43+
{
44+
arr2[i] = sc.nextInt();
45+
}
46+
47+
int [] mergeArray = mergeArray(arr1,arr2);
48+
System.out.println("Merged Array : " + Arrays.toString(mergeArray));
49+
sc.close();
50+
}
51+
52+
}

‎src/array_Programming/core/day_09/PrintingArrayElements.java‎

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
package array_Programming.core.day_09;
2+
3+
import java.util.Arrays;
4+
import java.util.Scanner;
5+
//1. WAPT Print all elements in an array.
6+
7+
public class PrintingArrayElements
8+
{
9+
public static void main(String[] args)
10+
{
11+
Scanner sc = new Scanner(System.in);
12+
System.out.println("Enter the size of the array : ");
13+
int size = sc.nextInt();
14+
System.out.println("Enter " + size + " elements : ");
15+
int [] arr = new int [size];
16+
for(int i = 0;i<=arr.length-1;i++)
17+
{
18+
arr[i] = sc.nextInt();
19+
}
20+
for(int i = 0;i<=arr.length-1;i++)
21+
{
22+
System.out.println("The elements present at the index " + i + " is " + arr[i]);
23+
}
24+
System.out.println("The array reperesentation is " + Arrays.toString(arr));
25+
}
26+
27+
}

‎src/array_Programming/core/day_09/ReverseOrder.java‎

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
package array_Programming.core.day_09;
2+
import java.util.Arrays;
3+
import java.util.Scanner;
4+
//3. WAPT Print the elements of an array in reverse order.
5+
6+
public class ReverseOrder
7+
{
8+
public static void printReverse(int [] arr)
9+
{
10+
int [] rev = new int [arr.length];
11+
int index = 0;
12+
System.out.println("Array in reverse order : ");
13+
for(int j =arr.length-1;j>=0;j--)
14+
{
15+
System.out.println(arr[j]);
16+
rev[index++] = arr[j];
17+
}
18+
System.out.println(Arrays.toString(rev));
19+
}
20+
public static void main(String[] args)
21+
{
22+
Scanner sc = new Scanner(System.in);
23+
System.out.println("Enter the size of the array : ");
24+
int size = sc.nextInt();
25+
int [] arr = new int [size];
26+
System.out.println("Enter the elements : ");
27+
for(int i = 0 ; i<arr.length;i++)
28+
{
29+
arr[i] = sc.nextInt();
30+
}
31+
System.out.println(Arrays.toString(arr));
32+
printReverse(arr);
33+
sc.close();
34+
}
35+
}

‎src/array_Programming/core/day_09/SmallestElement.java‎

Lines changed: 37 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,37 @@
1+
package array_Programming.core.day_09;
2+
3+
import java.util.Arrays;
4+
import java.util.Scanner;
5+
6+
//10. WAPT Print the smallest element in a given array.
7+
public class SmallestElement
8+
{
9+
public static int smallest(int [] arr)
10+
{
11+
int smallest = arr[0];
12+
for(int i = 0;i<=arr.length-1;i++)
13+
{
14+
if(arr[i]<smallest)
15+
{
16+
smallest = arr[i];
17+
}
18+
}
19+
System.out.println("The smallest element in the array : "+ smallest);
20+
return smallest;
21+
}
22+
public static void main(String[] args) {
23+
Scanner sc = new Scanner(System.in);
24+
System.out.println("Enter size of the array : ");
25+
int size = sc.nextInt();
26+
int [] arr = new int[size];
27+
System.out.println("Enter "+ size + " elements :");
28+
for(int i = 0;i<=arr.length-1;i++)
29+
{
30+
arr[i] = sc.nextInt();
31+
}
32+
System.out.println(Arrays.toString(arr));
33+
smallest(arr);
34+
sc.close();
35+
}
36+
37+
}

0 commit comments

Comments
 (0)