Answer and Explanation:
To calculate Big O, go through each line of code and determine O(!), O(n) and return your calculation.
For example,
In O (5 +6n), where 6 5 represent five instances of O(1), and 6 represent the 6 O(n).
We compute the time complexity of the algorithm. We get the result, just an estimation. In given algorithms, run time in milliseconds has been provided, such as in T (1) algorithm process in 512 milliseconds and T(2) algorithms process 8129 milliseconds. But big O notation not measured in milliseconds. Information given is not enough to calculate the big O notation.
Answer:
d, brainly wants this to be long so hdjddjd
Answer:
Explanation:
The following code is written in Java. The function takes in the random object and creates a random number where it generates a random number and prints out the * characters, if the random number and the input num are the same it prints out both values and ends the function.
import java.util.Random;
class Brainly {
public static void main(String[] args) {
Random r = new Random();
randomStar(r, 12);
System.out.println();
randomStar(r, 19);
}
public static void randomStar(Random r, int num) {
while (true) {
int randomNum = r.nextInt(19) + 5;
if (randomNum != num) {
for (int x = 0; x < randomNum; x++) {
System.out.print("*");
}
System.out.print("\n");
} else {
for (int x = 0; x < randomNum; x++) {
System.out.print("*");
}
System.out.print("\n");
System.out.println("Random Number: " + randomNum);
System.out.println("Input Number: " + num);
break;
}
}
}
}