Answer:
// here is code in java.
import java.util.*;
class Solution
{
// main method of class
public static void main (String[] args) throws java.lang.Exception
{
try{
// declare variable
double caffeine;
// scanner object to read input from user
Scanner scr=new Scanner(System.in);
System.out.print("Enter the initial amount of caffeine:");
// read the initial amount of caffeine
caffeine=scr.nextDouble();
// calculate amount of caffeine after 6,12,18 hours
for(int i=1;i<=3;i++)
{
System.out.println("After "+ i*6+" hours:"+(caffeine/2)+" mg");
// update the caffeine after every 6 hours
caffeine=caffeine/2;
}
}catch(Exception ex){
return;}
}
}
Explanation:
Create a variable "caffeine" to store the initial amount of caffeine given by user. Run a loop for three time, it will calculate the amount of caffeine left after every 6 hours.First it will give the amount of caffeine left after 6 hours, then caffeine left after 12 hours and in last caffeine after 18 hours.
Output:
Enter the initial amount of caffeine:100
After6 hours:50.0 mg
After12 hours:25.0 mg
After18 hours:12.5 mg
Answer:
language and interpersonal communication, basically it would make someone antisocial.
If your planning on going social Facebook is the way to go ! But for most people you may decide to post anonymously so ! Search "Anonymous Posts" on google and their should be many websites you can anonymously tell you trips and embarrassing experiences safely on :)
-Not to make impulse buys
-Open a savings account that directly adds a set amount of money into it from your paycheck monthly
-The '50-30-20' rule(<span>50 percent of your income toward necessities, like housing and bills. Twenty percent should then go toward financial goals, like paying off debt or </span>saving<span> for retirement. Finally, thirty percent of your income can be allocated to wants, like dining or entertainment.)</span>
-Create a budget
Answer:
The main benefit of the ordered list is that you can apply Binary Search( O( n log n) ) to search the elements. Instead of an unordered list, you need to go through the entire list to do the search( O(n) ).
The main cost of the ordered list is that every time you insert into a sorted list, you need to do comparisons to find where to place the element( O( n log n) ). But, every time you insert into an unsorted, you don't need to find where to place the element in the list ( O(1) ). Another cost for an ordered list is where you need to delete an element, you have an extra cost rearranging the list to maintain the order.
