All categories

3 years ago

Implement a java program to find the smallest distance between two neighbouring numbers in an array.

Computers and Technology

1 answer:

Alex17521 [72]3 years ago

6 0

<h2>Answer:</h2>

Here is the JAVA program to find smallest distance between 2 neighboring numbers in an array.

import java.lang.Math; // for importing Math class functions

import java.util.Scanner; // for importing Scanner class

public class CalSmallestDistance // class to calculate smallest distance

{public static void main(String[] args) { // to enter java program

Scanner s = new Scanner(System.in); //creating scanner object

int size; // size of the array

System.out.print("Enter size of the array:"); //prompts to enter array size

size = s.nextInt(); // reads input

int arr[] = new int[size]; // array named arr[]

//line below prompts to enter elements in the array System.out.println("Enter numbers in the array:");

for(int j = 0; j < size; j++) //loops through the array

{arr[j] = s.nextInt(); } //reads the input elements

int smallest_distance = Math.abs(arr[0]-arr[1]);

int position= 0; //index of the array

for(int i=1; i<arr.length-1; i++){

int distance= Math.abs(arr[i]-arr[i+1]);

if(distance< smallest_distance){

smallest_distance= distance;

position = i; } }

System.out.println("Smallest distance is :"+smallest_distance);

System.out.println("The numbers are :"+arr[position]+ " and " +arr[position+1]); } }

<h2>Explanation:</h2>

I have stated the minor explanation of some basic lines of code as comments in the code given above.

Now i will give the detailed explanation about the working of the main part of the code.

Lets start from here

int smallest_distance = Math.abs(arr[0]-arr[1]);

In this statement the array element at 0 index (1st position) and the array element at 1 index (2nd position) of the array are subtracted.

Then i used the math.abs() method here which gives absolute value

Lets say the distance between 3 and 5 is -2 as 3-5 equals to -2. But the math.abs() method will return 2 instead of -2.

Now the subtraction of two array elements and absolute value (if subtraction result is negative) will be assigned to variable smallest_distance.

for(int i=1; i<arr.length-1; i++)

This is for loop. Variable i is positioned to the 1 index of the array (arr) (it is pointing to the second element of the array). It will move through the array until the end of the array is reached i.e. the loop will continue till value of i remains less than the length of the array.

Now at the start of the loop body the following statement is encountered

int distance= Math.abs(arr[i]-arr[i+1]);

This subtracts the array element at i th position and array element at i th +1 position (means one position ahead of array element at i th position). In simple words two neighboring numbers in an array are being subtracted and Math.abs() method is used to give absolute value. The result of this operation is assigned to distance variable.

if(distance< smallest_distance)

This if statement checks if the value in distance variable is smallest than the value of smallest_distance variable which was previously calculated before calculating the value for distance variable.

If this condition is true then the following statements are executed:

smallest_distance= distance;

if distance value is less than value in smallest_distance, then the value of distance is assigned to smallest_distance.

this means the smallest_distance will keep on storing the smallest distance between two neighboring numbers.

Next the value of variable i that is pointing to the 1st index of the array is now assigned to the position variable.

position = i;

It will keep assigning the value of i to position variable so at the end of the program we can get the positions of the two neighboring numbers that have the smallest distance between them.

Then the value of i is incremented and moves one place ahead in the array.

Then the 2nd iteration takes place and again checks if i pointer variable has reached the end of the array. If not the loop body will continue to execute in which the distance between the two neighboring numbers is calculated and shortest distance is stored in smallest_distance.

When i reaches the end of the array the loop will break and the smallest distance between two neighboring numbers in the array have been stored in the smallest_distance variable.

Finally the statement System.out.println("Smallest distance is :"+smallest_distance); displays the shortest distance and the statement System.out.println("The numbers are :"+arr[position]+ " and " +arr[position+1]); displays the array index positions at which the two neighboring numbers have the smallest distance.

You might be interested in

When you're working with a word processing document and you press the del key, what happens?

Svetach [21]

The <DEL> or <Delete> key makes the first character AFTER the cursor
disappear, and everything after it then moves back one space to close up
the hole.

Example:

If I have this in my document ... Most trees are green.

And my cursor is after the 'a', like this: Most trees a|re green.

Now, if I hit the <delete> key, it deletes the
'r' after the cursor, and the hole closes up,
and the cursor stays where it is: Most trees a|e green.

5 0

3 years ago

Read 2 more answers

Programming challenge description: Write a program that, given two binary numbers represented as strings, prints their sum in bi

Lubov Fominskaja [6]

Answer:

The program to this question can be given as:

Program:

#include<iostream> //include header file

using namespace std;

string add(string a, string b) //define add function

{ //declare variable

string result = "";

int sum = 0,k,l;

cahr x;

k= a.size() - 1;

l = b.size() - 1;

while (k>= 0 || l>= 0 || sum == 1) //loop

{

//addition

sum= sum+ ((k >= 0)? a[k] - '0': 0);

sum= sum+ ((l >= 0)? b[l] - '0': 0);

x=sum%2;

result=(x+'0') +result;

// Compute carry

sum =sum/ 2;

// Move to next digits

k--;

l--;

}

return result; //return value

}

int main() //main method

{

string a,b; //string variable

cout<<"Enter first binary digit: "; //message.

cin>>a; //input from user

cout<<"Enter Second binary digit: "; //message.

cin>>b; //input from user

cout <<"Addition :"<<add(a, b)<<endl; //print addition

return 0;

}

Output:

Enter first binary digit: 1101

Enter Second binary digit: 100

Addition :10001

Explanation:

In the above c++ program first, we include the header file. Then we define the add function in the add function we add two binary digits by passing value as arguments. In this function, we define a variable that is used on the addition of binary numbers. In this function we define the loop in the loop we check if two binary number is 1 then it will print 0 and pass 1 as the carry. after performing addition it will return value. In the main function, we take two binary numbers from the user and pass the value to the function and print function return value.

8 0

3 years ago

Suppose that a machine with a 5-stage pipeline uses branch prediction. 15% of the instructions for a given test program are bran

zhenek [66]

Answer:

solution attached below

Explanation:

3 0

3 years ago

Does a newer game work on older computer

babunello [35]

I don't think so because the old computers may have not been to date as what we have now but check it out and see.

5 0

3 years ago

(Count positive and negative numbers and compute the average of numbers) Write a program that reads an unspecified number of int

Papessa [141]

Answer:

Explanation:

Sorry it is in Java, though you can covert it using converter

public class Exercise {

public static void main(String[] args) {

Scanner input = new Scanner(System.in);

int positives = 0; // Count the number of positive numbers

int negatives = 0; // Count the number of negative numbers

int count = 0; // Count all numbers

double total = 0; // Accumulate a totol

// Promopt the user to enter an integer or 0 to exit

System.out.print("Enter an integer, the input ends if it is 0: ");

int number = input.nextInt();

if (number == 0) { // Test for sentinel value

System.out.println("No numbers are entered except 0");

System.exit(1);

}

while (number != 0) {// Test for sentinel value

if (number > 0)

positives++; // Increase positives

else

negatives++; // Increase negatives

total += number; // Accumulate total

count++; // Increase the count

number = input.nextInt();

}

// Calculate the average

double average = total / count;

// Display results

System.out.println(

"The number of positive is " + positives +

"\nThe number of negatives is " + negatives +

"\nThe total is total " + total +

"\nThe average is " + average);

}

7 0

3 years ago