Skip to content

Commit b48c762

Browse files
curious-vasavicurious-vasavi
committed
Add Day 11 medium level array Programs
1 parent 0f3c2ee commit b48c762

10 files changed

+619
-0
lines changed

‎src/array_Programming/medium/day_11/LargestEvenElement.java‎

Lines changed: 62 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,62 @@
1+
package array_Programming.medium.day_11;
2+
import java.util.Arrays;
3+
import java.util.Scanner;
4+
//27. Print the largest even element in a given array.
5+
public class LargestEvenElement
6+
{
7+
public static void printLargestEven(int[] arr)
8+
{
9+
for (int i = 0; i < arr.length; i++)
10+
{
11+
for (int j = i + 1; j < arr.length; j++)
12+
{
13+
if (arr[i] > arr[j])
14+
{
15+
int temp = arr[i];
16+
arr[i] = arr[j];
17+
arr[j] = temp;
18+
}
19+
}
20+
}
21+
22+
boolean found = false;
23+
for (int i = arr.length - 1; i >= 0; i--)
24+
{
25+
if (arr[i] % 2 == 0)
26+
{
27+
System.out.println("Largest even element: " + arr[i]);
28+
found = true;
29+
break;
30+
}
31+
}
32+
33+
if (!found)
34+
{
35+
System.out.println("No even element found in the array.");
36+
}
37+
}
38+
39+
public static void main(String[] args)
40+
{
41+
Scanner sc = new Scanner(System.in);
42+
43+
System.out.println("Enter the size of the array:");
44+
int size = sc.nextInt();
45+
46+
int[] arr = new int[size];
47+
48+
System.out.println("Enter " + size + " elements:");
49+
for (int i = 0; i < arr.length; i++)
50+
{
51+
arr[i] = sc.nextInt();
52+
}
53+
54+
System.out.println("Array: " + Arrays.toString(arr));
55+
printLargestEven(arr);
56+
57+
sc.close();
58+
}
59+
}
60+
61+
62+

‎src/array_Programming/medium/day_11/LargestPrimeNumber.java‎

Lines changed: 73 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,73 @@
1+
package array_Programming.medium.day_11;
2+
import java.util.Arrays;
3+
import java.util.Scanner;
4+
//29. Print the largest prime number in a given array.
5+
public class LargestPrimeNumber
6+
{
7+
public static boolean isPrime(int num)
8+
{
9+
if (num <= 1)
10+
return false;
11+
12+
for (int i = 2; i <= num / 2; i++)
13+
{
14+
if (num % i == 0)
15+
return false;
16+
}
17+
return true;
18+
}
19+
20+
public static void printLargestPrime(int[] arr)
21+
{
22+
for (int i = 0; i < arr.length; i++)
23+
{
24+
for (int j = i + 1; j < arr.length; j++)
25+
{
26+
if (arr[i] > arr[j])
27+
{
28+
int temp = arr[i];
29+
arr[i] = arr[j];
30+
arr[j] = temp;
31+
}
32+
}
33+
}
34+
35+
boolean found = false;
36+
for (int i = arr.length - 1; i >= 0; i--)
37+
{
38+
if (isPrime(arr[i]))
39+
{
40+
System.out.println("Largest prime element: " + arr[i]);
41+
found = true;
42+
break;
43+
}
44+
}
45+
46+
if (!found)
47+
{
48+
System.out.println("No prime number found in the array.");
49+
}
50+
}
51+
52+
public static void main(String[] args)
53+
{
54+
Scanner sc = new Scanner(System.in);
55+
56+
System.out.println("Enter the size of the array:");
57+
int size = sc.nextInt();
58+
59+
int[] arr = new int[size];
60+
61+
System.out.println("Enter " + size + " elements:");
62+
for (int i = 0; i < arr.length; i++)
63+
{
64+
arr[i] = sc.nextInt();
65+
}
66+
67+
System.out.println("Array: " + Arrays.toString(arr));
68+
printLargestPrime(arr);
69+
70+
sc.close();
71+
}
72+
}
73+

‎src/array_Programming/medium/day_11/MergeAndSort.java‎

Lines changed: 73 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,73 @@
1+
package array_Programming.medium.day_11;
2+
//21. Merge two arrays and sort the merged elements.
3+
import java.util.Arrays;
4+
import java.util.Scanner;
5+
6+
public class MergeAndSort
7+
{
8+
public static int[] mergeArrays(int[] arr1, int[] arr2)
9+
{
10+
int[] merged = new int[arr1.length + arr2.length];
11+
int index = 0;
12+
13+
for (int i = 0; i < arr1.length; i++)
14+
{
15+
merged[index++] = arr1[i];
16+
}
17+
18+
for (int i = 0; i < arr2.length; i++)
19+
{
20+
merged[index++] = arr2[i];
21+
}
22+
23+
return merged;
24+
}
25+
26+
public static void sortArray(int[] arr)
27+
{
28+
for (int i = 0; i < arr.length; i++)
29+
{
30+
for (int j = i + 1; j < arr.length; j++)
31+
{
32+
if (arr[i] > arr[j])
33+
{
34+
int temp = arr[i];
35+
arr[i] = arr[j];
36+
arr[j] = temp;
37+
}
38+
}
39+
}
40+
}
41+
42+
public static void main(String[] args)
43+
{
44+
Scanner sc = new Scanner(System.in);
45+
46+
System.out.println("Enter size of first array:");
47+
int n1 = sc.nextInt();
48+
int[] arr1 = new int[n1];
49+
50+
System.out.println("Enter " + n1 + " elements:");
51+
for (int i = 0; i < arr1.length; i++)
52+
{
53+
arr1[i] = sc.nextInt();
54+
}
55+
56+
System.out.println("Enter size of second array:");
57+
int n2 = sc.nextInt();
58+
int[] arr2 = new int[n2];
59+
60+
System.out.println("Enter " + n2 + " elements:");
61+
for (int i = 0; i < arr2.length; i++)
62+
{
63+
arr2[i] = sc.nextInt();
64+
}
65+
66+
int[] mergedArray = mergeArrays(arr1, arr2);
67+
sortArray(mergedArray);
68+
69+
System.out.println("Merged and sorted array: " + Arrays.toString(mergedArray));
70+
71+
sc.close();
72+
}
73+
}

‎src/array_Programming/medium/day_11/NthLargestElement.java‎

Lines changed: 58 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,58 @@
1+
package array_Programming.medium.day_11;
2+
import java.util.Arrays;
3+
import java.util.Scanner;
4+
//25. Print the nth largest element in a given array.
5+
public class NthLargestElement
6+
{
7+
public static void printNthLargest(int[] arr, int n)
8+
{
9+
if (n <= 0 || n > arr.length)
10+
{
11+
System.out.println("Invalid value of n.");
12+
return;
13+
}
14+
15+
for (int i = 0; i < arr.length; i++)
16+
{
17+
for (int j = i + 1; j < arr.length; j++)
18+
{
19+
if (arr[i] > arr[j])
20+
{
21+
int temp = arr[i];
22+
arr[i] = arr[j];
23+
arr[j] = temp;
24+
}
25+
}
26+
}
27+
28+
int nthLargest = arr[arr.length - n];
29+
System.out.println(n + "th largest element: " + nthLargest);
30+
}
31+
32+
public static void main(String[] args)
33+
{
34+
Scanner sc = new Scanner(System.in);
35+
36+
System.out.println("Enter the size of the array:");
37+
int size = sc.nextInt();
38+
39+
int[] arr = new int[size];
40+
41+
System.out.println("Enter " + size + " elements:");
42+
for (int i = 0; i < arr.length; i++)
43+
{
44+
arr[i] = sc.nextInt();
45+
}
46+
47+
System.out.println("Enter value of n:");
48+
int n = sc.nextInt();
49+
50+
System.out.println("Array: " + Arrays.toString(arr));
51+
printNthLargest(arr, n);
52+
53+
sc.close();
54+
}
55+
}
56+
57+
58+

‎src/array_Programming/medium/day_11/NthSmallestElement.java‎

Lines changed: 56 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,56 @@
1+
package array_Programming.medium.day_11;
2+
import java.util.Arrays;
3+
import java.util.Scanner;
4+
//26. Print the nth smallest element in a given array.
5+
public class NthSmallestElement
6+
{
7+
8+
public static void printNthSmallest(int[] arr, int n)
9+
{
10+
if (n <= 0 || n > arr.length)
11+
{
12+
System.out.println("Invalid value of n.");
13+
return;
14+
}
15+
16+
for (int i = 0; i < arr.length; i++)
17+
{
18+
for (int j = i + 1; j < arr.length; j++)
19+
{
20+
if (arr[i] > arr[j])
21+
{
22+
int temp = arr[i];
23+
arr[i] = arr[j];
24+
arr[j] = temp;
25+
}
26+
}
27+
}
28+
29+
int nthSmallest = arr[n - 1];
30+
System.out.println(n + "th smallest element: " + nthSmallest);
31+
}
32+
33+
public static void main(String[] args)
34+
{
35+
Scanner sc = new Scanner(System.in);
36+
37+
System.out.println("Enter the size of the array:");
38+
int size = sc.nextInt();
39+
40+
int[] arr = new int[size];
41+
42+
System.out.println("Enter " + size + " elements:");
43+
for (int i = 0; i < arr.length; i++)
44+
{
45+
arr[i] = sc.nextInt();
46+
}
47+
48+
System.out.println("Enter value of n:");
49+
int n = sc.nextInt();
50+
51+
System.out.println("Array: " + Arrays.toString(arr));
52+
printNthSmallest(arr, n);
53+
54+
sc.close();
55+
}
56+
}

‎src/array_Programming/medium/day_11/SecondLargestElement.java‎

Lines changed: 65 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,65 @@
1+
package array_Programming.medium.day_11;
2+
import java.util.Arrays;
3+
import java.util.Scanner;
4+
5+
//23. Print the second largest element in an array.
6+
public class SecondLargestElement
7+
{
8+
public static void printSecondLargest(int[] arr)
9+
{
10+
if (arr.length < 2)
11+
{
12+
System.out.println("Array must contain at least two elements.");
13+
return;
14+
}
15+
16+
int largest = Integer.MIN_VALUE;
17+
int secondLargest = Integer.MIN_VALUE;
18+
19+
for (int i = 0; i < arr.length; i++)
20+
{
21+
if (arr[i] > largest)
22+
{
23+
secondLargest = largest;
24+
largest = arr[i];
25+
}
26+
else if (arr[i] > secondLargest && arr[i] != largest)
27+
{
28+
secondLargest = arr[i];
29+
}
30+
}
31+
32+
if (secondLargest == Integer.MIN_VALUE)
33+
{
34+
System.out.println("No second largest element exists.");
35+
}
36+
else
37+
{
38+
System.out.println("Second largest element: " + secondLargest);
39+
}
40+
}
41+
42+
public static void main(String[] args)
43+
{
44+
Scanner sc = new Scanner(System.in);
45+
46+
System.out.println("Enter the size of the array:");
47+
int size = sc.nextInt();
48+
49+
int[] arr = new int[size];
50+
51+
System.out.println("Enter " + size + " elements:");
52+
for (int i = 0; i < arr.length; i++)
53+
{
54+
arr[i] = sc.nextInt();
55+
}
56+
57+
System.out.println("Array: " + Arrays.toString(arr));
58+
printSecondLargest(arr);
59+
60+
sc.close();
61+
}
62+
}
63+
64+
65+

0 commit comments

Comments
 (0)