Answer:
// program in java.
import java.util.*;
// class definition
class Main
{// main method of the class
public static void main (String[] args) throws java.lang.Exception
{
try{
// object to read input
Scanner scr=new Scanner(System.in);
// ask to enter name
System.out.print("Enter Your name: ");
// read name from user
String NAME=scr.nextLine();
// print message
System.out.println("Greetings,"+NAME);
}catch(Exception ex){
return;}
}
}
Explanation:
Read name from user with the help of scanner object and assign it to variable "NAME".Then print a Greetings message as "Greetings,NAME" where NAME will be replaced with user's input name.
Output:
Enter Your name: Rachel
Greetings,Rachel
<span>The quick styles gallery is the place where the available sets of fonts, designs, settings designed and stored in office applications. </span><span>The styles are all presented as examples in the gallery. </span><span> </span><span> </span><span>If a computer user wanted one of these styles, he can click one style and then it would automatically be applied to the document. A style can be used, created and be removed if wanted.</span>
Answer: provide climate data representing times when instruments were not available to measure them.
Explanation:
Proxy data provides climate data representing times when instruments were not available to measure them.
I’m here, hello. . . . . . .
If an algorithm's resource consumption, often referred to as computational cost, is at or below a certain threshold, it is said to be efficient. Generally speaking, "acceptable" indicates that it will operate on a machine that is available in a fair amount of time or space, usually based on the size of the input.
<h3>Explain about the efficiency of an algorithm?</h3>
Growth requires an understanding of an algorithm's effectiveness. Programmers write code with the future in mind, and efficiency is essential to achieve this. Reducing the number of iterations required to finish your task in relation to the size of the dataset is the goal of efficient algorithm development.
The use of asymptotic analysis can frequently help to solve these issues. As the size of the input increases, asymptotic analysis quantifies an algorithm's effectiveness or the program that implements it.
To express how time-consuming a function is, we use a method called "Big O notation." We use the Big O notation, a language, to describe how time-consuming an algorithm is. It's how we assess the value of several approaches to an issue, and U supports our decision-making.
To learn more about efficiency of an algorithm refer to:
brainly.com/question/13801939
#SPJ4
