Answer:
import java.util.Scanner;
import java.util.Arrays;
import java.util.Random;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.print("Enter low: ");
int low = scan.nextInt();
System.out.print("Enter high: ");
int high = scan.nextInt();
scan.close();
int rndnumbers[] = new int[10];
Random r = new Random();
for(int i=0; i<rndnumbers.length; i++) {
rndnumbers[i] = r.nextInt(high-low+1) + low;
}
for(int i=0; i<rndnumbers.length; i++) {
System.out.printf("%d: %d\n", i, rndnumbers[i]);
}
}
}
Answer:
The value of 8n would be 16
8n
8(2)= 16
(uhh this is a math question right? Sorry if it has to deal with tech)
Answer:
#include <stdio.h>
int fib(int n) {
if (n <= 0) {
return 0;
}
if (n <= 2) {
return 1;
}
return fib(n-1) + fib(n-2);
}
int main(void) {
for(int nr=0; nr<=20; nr++)
printf("Fibonacci %d is %d\n", nr, fib(nr) );
return 0;
}
Explanation:
The code is a literal translation of the definition using a recursive function.
The recursive function is not per se a very efficient one.
