a) You are given two different codes for finding the n-th Fibonacci number. Find the time complexity of both implementations and compare the two. Implementation 1 def fibonacci_1 (n) : if n < 0: print ("Invalid input!") elif n <= 1: return n else: return fibonacci_1 (n-1)+fibonacci_1 (n-2) n = int (input ("Enter a number: ")) nth_fib = fibonacci_1 (n) print ("The {} th fibonacci number is {}.". format (n, nth_fib)) Implementation 2 def fibonacci_2 (n) : if n<0: return "Invalid Input" if n<=1: return n fib= [0] (n+1) fib[0] = 0 fib[1] = 1 for i in range (2, n+1): fib[i] = fib[i-1] + fib[i-2] return fib[n] n = int (input ("Enter a number: ")) nth_fib = fibonacci_2 (n) print("The {} th fibonacci number is {}.". format (n, nth_fib))

a) You are given two different codes for finding the n-th Fibonacci number. Find the time complexity of both implementations and compare the two. Implementation 1 def fibonacci_1 (n) : if n < 0: print ("Invalid input!") elif n <= 1: return n else: return fibonacci_1 (n-1)+fibonacci_1 (n-2) n = int (input ("Enter a number: ")) nth_fib = fibonacci_1 (n) print ("The {} th fibonacci number is {}.". format (n, nth_fib)) Implementation 2 def fibonacci_2 (n) : if n<0: return "Invalid Input" if n<=1: return n fib= [0] (n+1) fib[0] = 0 fib[1] = 1 for i in range (2, n+1): fib[i] = fib[i-1] + fib[i-2] return fib[n] n = int (input ("Enter a number: ")) nth_fib = fibonacci_2 (n) print("The {} th fibonacci number is {}.". format (n, nth_fib))

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Please give code in C language. no screenshots please please. For this assignment, you need to study the performance of 2 designed algorithms using different logic. You need to write a program that takes N (size of input) then write the following functions/methods: int[] GenerateValues (N) where N is random int values between 0 and N-1. DistinctValues Algorithms: int findDistintValuesWithoutSort( A, N) to count the number of distinct values in A without sorting algorithm. int findDistintValuesWithSort( A, N) to count the number of distinct values using any sorting algorithm (i.e., quicksort or merge sort or heapsort). Print the execution time for each method to find the distinct values where N = 103, 104, and 105. Note the execution time in a table and discuss your results in the document file. Discuss the execution time compared to your big -O analysis of the 2 DistinctValues algorithms.
The factorial of a positive integer n —which we denote as n!—is the product of n and the factorial of n 1. The factorial of 0 is 1. Write two different recursive methods in Java that each return the factorial of n. Analyze your algorithm in Big-Oh notation and provide the appropriate analysis, ensuring that your program has a test class.
please do it in very simple way
Write a program called Recursive_fibonacci.java that implements a recursive function for computing the nth term of a Fibonacci Sequence. In the main method of your program accept the value of n from the user as a command-line argument and then call your function named Fibonacci with this value. The output should look exactly like what is pictured below.
Please do this on JAVA PROGRAMMING
def hailstone(n): h.append(int(n)) if n == 1: return h while n != 1: if n % 2 == 0: return hailstone(int(n/2)) else: return hailstone(int(3*n + 1))y=int(input("N: "))if y <= 0: print("N must be positive!")else: print("Hailstone sequences for 1 to " + str(y) + ": ") m=0; i=1 for x in range(1, y+1): n = i h = [] h = hailstone(n) print(*h) print(",") s=len(h) if s > m: m=s flag=n i=i+1 print("First longest sequence found in n =", + flag ) How can I fix this code if I want a comma between each number, not each line?
bitcount: Given x, set y to the number of bits in x that are 1. Write the code in Java. Provided input(s): x Permitted: 40 operations (may use !, ~, +, -, <<, >>, &, ^, |) Hint: The obvious solution would be something like ans=0; for(int i=0; i<32; i+=1) { a += x&1; x >>=1; } We don’t allow for loops, but even if you replace it with 32 copies that’s still 96 operations, and we only allow 40 for this task. The trick is to do things in parallel, treating a number like a vector of smaller numbers. Suppose I wanted to count the bits of an 8-bit number with bits abcdefgh. With a little shifting and masking I could make three numbers 0b00e00h 0a00d00g 0000c00f and add them to get xx0yy0zz where xx = a+b, yy = c+d+e, and zz = f+g+h. Extending this trick to several rounds on 32 bits will solve this problem.
java
Java Program: Recursive Method There are n people in a room where n is an integer greater then or equal to 2. Each person shakes hands once with every other person. What is the total number of handshakes in the room? Write a recursive method to solve this problem with the following header:public static int handshake(int n)where handshake(n) returns the total number of handshakes for n people in the room. To get you started if there are only one or two people in the room, then:handshake(1)=0handshake(2)=1
5. Given # > 3 points P₁ = (x₁, y₁), …….‚ P₂ = (x₂‹ Yn) in the coordinate plane, design an algorithm to check whether all the points lie within a triangle with its vertices at three of the points given. (You can either design an algorithm from scratch or reduce the problem to another one with a known algorithm.)