Java - Introduction to Programming
Lecture 10
Arrays In Java
Arrays in Java are like a list of elements of the same type i.e. a list of integers, a list of
booleans etc.
a. Creating an Array (method 1) - with new keyword
int[] marks = new int[3];
marks[0] = 97;
marks[1] = 98;
marks[2] = 95;
b. Creating an Array (method 2)
int[] marks = {98, 97, 95};
c. Taking an array as an input and printing its elements.
import [Link].*;
public class Arrays {
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
int size = [Link]();
int numbers[] = new int[size];
for(int i=0; i<size; i++) {
numbers[i] = [Link]();
}
//print the numbers in array
for(int i=0; i<[Link]; i++) {
[Link](numbers[i]+" ");
}
}
}
Apna College
Homework Problems
1. Take an array of names as input from the user and print them on the screen.
import [Link].*;
public class Arrays {
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
int size = [Link]();
String names[] = new String[size];
//input
for(int i=0; i<size; i++) {
names[i] = [Link]();
//output
for(int i=0; i<[Link]; i++) {
[Link]("name " + (i+1) +" is : " + names[i]);
2. Find the maximum & minimum number in an array of integers.
Apna College
[HINT : Read about Integer.MIN_VALUE & Integer.MAX_VALUE in Java]
import [Link].*;
public class Arrays {
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
int size = [Link]();
int numbers[] = new int[size];
//input
for(int i=0; i<size; i++) {
numbers[i] = [Link]();
int max = Integer.MIN_VALUE;
int min = Integer.MAX_VALUE;
for(int i=0; i<[Link]; i++) {
if(numbers[i] < min) {
min = numbers[i];
if(numbers[i] > max) {
max = numbers[i];
Apna College
[Link]("Largest number is : " + max);
[Link]("Smallest number is : " + min);
3. Take an array of numbers as input and check if it is an array sorted in
ascending order.
Eg : { 1, 2, 4, 7 } is sorted in ascending order.
{3, 4, 6, 2} is not sorted in ascending order.
import [Link].*;
public class Arrays {
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
int size = [Link]();
int numbers[] = new int[size];
//input
for(int i=0; i<size; i++) {
numbers[i] = [Link]();
boolean isAscending = true;
Apna College
for(int i=0; i<[Link]-1; i++) { // NOTICE [Link] - 1 as
termination condition
if(numbers[i] > numbers[i+1]) { // This is the condition for
descending order
isAscending = false;
if(isAscending) {
[Link]("The array is sorted in ascending order");
} else {
[Link]("The array is not sorted in ascending order");
Apna College