On the bottom corner you can see something that looks like this:
|--- | -- | ---|
Click the middle one?
Answer:
import java.util.Scanner;
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int numbers[] = new int[3];
System.out.print("Enter first number: ");
numbers[0] = scan.nextInt();
System.out.print("Enter second number: ");
numbers[1] = scan.nextInt();
System.out.print("Enter third number: ");
numbers[2] = scan.nextInt();
scan.close();
Arrays.sort(numbers);
if (numbers[0] == numbers[2]) {
System.out.println("All the numbers are equal");
} else {
System.out.printf("Greatest number: %d\n", numbers[2]);
}
}
}
Answer:
A node is a connection point inside a network that can receive, send, create, or store data. Each node requires you to provide some form of identification to receive access, like an IP address. A few examples of nodes include computers, printers, modems, bridges, and switches.
The browser should default to Calibri (body)
Answer:
The time complexity of the code is O(log₇n).
Explanation:
The i is updated by 7*i.On each iteration i is multiplied by 7.So on finding the time complexity of the code given above it will come out to be log base 7.
When we divide the input by 2 the time complexity is log base 2.
So on dividing it by 7 we get the time complexity of log base 7.
