Arrays
Find the max element in an array
import java.util.Scanner;
public class FindMaxInArray {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of elements in the array: ");
int n = scanner.nextInt();
int[] numbers = new int[n];
System.out.println("Enter the elements of the array:");
for (int i = 0; i < n; i++) {
numbers[i] = scanner.nextInt();
}
scanner.close();
int max = numbers[0];
for (int i = 1; i < numbers.length; i++) {
if (numbers[i] > max) {
max = numbers[i];
}
}
System.out.println("Maximum number in the array: " + max);
}
}
************************************************************
Reversing an Array
import java.util.Scanner;
public class ReverseArray {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of elements in the array: ");
int n = scanner.nextInt();
int[] numbers = new int[n];
System.out.println("Enter the elements of the array:");
for (int i = 0; i < n; i++) {
numbers[i] = scanner.nextInt();
}
scanner.close();
int[] reversed = new int[numbers.length];
for (int i = 0; i < numbers.length; i++) {
reversed[i] = numbers[numbers.length - 1 - i];
}
System.out.print("Original array: ");
for (int num : numbers) {
System.out.print(num + " ");
}
System.out.println("\nReversed array: ");
for (int num : reversed) {
System.out.print(num + " ");
}
}
}
***************************************************
Sorting The array (using bubble sort)
import java.util.Scanner;
public class BubbleSort {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of elements in the array: ");
int n = scanner.nextInt();
int[] numbers = new int[n];
System.out.println("Enter the elements of the array:");
for (int i = 0; i < n; i++) {
numbers[i] = scanner.nextInt();
}
scanner.close();
for (int i = 0; i < numbers.length - 1; i++) {
for (int j = 0; j < numbers.length - i - 1; j++) {
if (numbers[j] > numbers[j + 1]) {
// Swap numbers[j] and numbers[j + 1]
int temp = numbers[j];
numbers[j] = numbers[j + 1];
numbers[j + 1] = temp;
}
}
}
System.out.println("Sorted array: ");
for (int num : numbers) {
System.out.print(num + " ");
}
}
}
*****************************************************
Sum and Average of Elements in the array
import java.util.Scanner;
public class ArraySumAverage {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of elements in the array: ");
int n = scanner.nextInt();
int[] numbers = new int[n];
System.out.println("Enter the elements of the array:");
for (int i = 0; i < n; i++) {
numbers[i] = scanner.nextInt();
}
scanner.close();
int sum = 0;
for (int num : numbers) {
sum += num;
}
double average = (double) sum / numbers.length;
System.out.println("Sum of elements: " + sum);
System.out.println("Average of elements: " + average);
}
}
*************************************************
Searching for an element in the array ( Linear Search)
import java.util.Scanner;
public class ArraySearch {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of elements in the array: ");
int n = scanner.nextInt();
int[] numbers = new int[n];
System.out.println("Enter the elements of the array:");
for (int i = 0; i < n; i++) {
numbers[i] = scanner.nextInt();
}
System.out.print("Enter the number to search for: ");
int target = scanner.nextInt();
boolean found = false;
for (int i=0;i<n;i++) {
if (numbers[i] == target) {
found = true;
break;
}
}
if (found) {
System.out.println("Element " + target + " found at pos"+ i + "in the array.");
} else {
System.out.println("Element " + target + " not found in the array.");
}
}
}
Comments
Post a Comment