Answer:
nah
Explanation:
is a lame game for lil kids
The statements that correctly describe the time complexity of data structures with N data are:
- The average time complexity of the data lookup in a hash table is O(N).
- The average time complexity of inserting data into a heap is O(logN)
<h3>What is time complexity of data structures?</h3>
Time Complexity of an algorithm is known to be the depiction of the amount of time needed by the algorithm to carry out to completion.
Note that The statements that correctly describe the time complexity of data structures with N data are:
- The average time complexity of the data lookup in a hash table is O(N).
- The average time complexity of inserting data into a heap is O(logN)
Learn more about data from
brainly.com/question/17350816
#SPJ1
Import java.util.Scanner;
public class MinutesConversion {
private static Scanner inputDevice;
public static void main(String[] args) {
int minutes, hours;
float days; // float for decimal point
inputDevice = new Scanner(System.in);
System.out.println("Please enter minutes for conversion >> ");
minutes = inputDevice.nextInt();
hours = minutes / 60;
days = hours / 24.0f;
System.out.println(+ minutes + " minutes is " + hours + " hour(s) or" + days " days");
}
}
Answer:
mouse, track ball, stick, touch pad, tablet
Answer:
50%
Explanation:
The markup is the difference between the selling price and the cost price. If the mark up is greater than zero, it means there is a profit, if the markup is less than 0, it means there is a loss and if the markup is equal to 0, it means there is breakeven.
Percentage markup = (markup/cost price) * 100%
Selling price - cost price = markup
15 - cost price = 5
cost price = 10
Percentage markup = (markup/cost price) * 100% = (5/10) * 100% = 50%
