Compare the algorithm below: Algorithm 1 for i= 0 to i = 4 get the num[i]...
Compare the algorithm below:
Algorithm 1
for i= 0 to i = 4
get the num[i]
sum = sum + num[i]
Average = sum / 5
Print sum
Print average
Algorithm 2
- for i= 0 to i = 4
- get the num[i]
- for i= 0 to i = 4
- sum = sum + num[i]
- Average = sum / 5
- Print sum
- Print average
Calculate the complexity of the algorithm. Choose the most efficient algorithm, explain your choice.
Homework Answers
Lets take n = 4 Algorithm 1: It is one loop running for 4 times. So, Time complexity = O(n) Algorithm 2: first loop running for 4 times. and second loop is also running for 4 times. So, Time complexity = O(n*n) = O(n^2) So, The algorithm which has less time complexity is the best algorithm. So, Algorithm 1 is most efficient than algorithm 2.
Add Answer to:
Compare the algorithm below:
Algorithm 1
for i= 0 to i = 4
get the num[i]...
I have this code for python: num = int(input()) if num == 0: print('No change') else:...
I have this code for python: num = int(input()) if num == 0: print('No change') else: dol = num // 100 num %= 100 Quarters = num // 25 num %= 25 Dimes = num // 10 num %= 10 Nickels = num // 5 num %= 5 Pennies = num if dol > 0: if dol == 1: print('1 Dollar') if Dollars > 1: print(dol,'Dollars') if Quarters > 0: if Quarters == 1: print('1 Quarter') if Quarters > 1:...
3. Calculate the time complexity of the following algorithm: 1. Initialize sum to 0. I 2....
3. Calculate the time complexity of the following algorithm: 1. Initialize sum to 0. I 2. Input the value of n. 3. While i = 0 to n-1 do a. sum=sumti; ; b. Increment i
3) [16 points totall Consider the following algorithm: int SillyCalc (int n) { int i; int Num, answer; if (n <...
3) [16 points totall Consider the following algorithm: int SillyCalc (int n) { int i; int Num, answer; if (n < 4) 10; return n+ else f SillyCalc(Ln/4) answer Num Num 10 for (i-2; i<=n-1; i++) Num + = answer + answer; answer return answer } Do a worst case analysis of this algorithm, counting additions only (but not loop counter additions) as the basic operation counted, and assuming that n is a power of 2, i.e. that n- 2*...
3) [16 points total] Consider the following algorithm int SillyCalc (int n) int i; int Num, answer; if (n <=...
3) [16 points total] Consider the following algorithm int SillyCalc (int n) int i; int Num, answer; if (n <= 4) return n 10; else { Num-SillyCalcl n/4) answer = Num + Num + 10; for (i-2; i<-n-1; ++) answer- answer+ answer; return answer; Do a worst case analysis of this algorithm, counting additions only (but not loop counter additions) as the basic operation counted, and assuming that n is a power of 2, i.e. that n- 2* for some...
Please, I need help debuuging my code. Sample output is below MINN = 1 MAXX =...
Please, I need help debuuging my code. Sample output is below MINN = 1 MAXX = 100 #gets an integer def getValidInt(MINN, MAXX): message = "Enter an integer between" + str(MINN) + "and" + str(MAXX)+ "(inclusive): "#message to ask the user num = int(input(message)) while num < MINN or num > MAXX: print("Invalid choice!") num = int(input(message)) #return result return num #counts dupes def twoInARow(numbers): ans = "No duplicates next to each...
Can I please have a simple pseudocode algorithm of this problem. 1 Design an algorithm that...
Can I please have a simple pseudocode algorithm of
this problem.
1 Design an algorithm that will read a series of 50 integers at the terminal. The first integer is special, as it indicates how many more integers will follow. Your algorithm is to calculate and print the sum and average of the integers, excluding the first integer, and display these values to the screen.
Consider the following pseudocode: Algorithm RecursiveFunction (a, b) // a and b are integers if (as1...
Consider the following pseudocode: Algorithm RecursiveFunction (a, b) // a and b are integers if (as1 ) return b; else return RecursiveFunction (a-2, a/2); endif a. What is the time complexity of the RecursiveFunction pseudocode shown above? b What is the space complexity of the RecursiveFunction pseudocode shown above? n(n+1) C. What is the time complexity of the following algorithm (Note that 21-, i = n(n+1)(2n+1). and Σ.,1 ): Provide both T(n) and order, Ofn)). int A=0; for (int i=0;i<n;i++)...
1(5 pts): For each code fragment below, give the complexity of the algorithm (O or Θ)....
1(5 pts): For each code fragment below, give the complexity of the algorithm (O or Θ). Give the tightest possible upper bound as the input size variable increases. The input size variable in these questions is exclusively n. Complexity Code public static int recursiveFunction (int n)f f( n <= 0 ) return 0; return recursiveFunction (n - 1) 1; for(int i 0i <n; i+) j=0; for ( int j k=0; i; k < < j++) for (int j; m <...
Question No.1 [CLO 1][7 marks] 1. Consider the following pseudocode: Algorithm IterativeFunction (a, b) // a...
Question No.1 [CLO 1][7 marks] 1. Consider the following pseudocode: Algorithm IterativeFunction (a, b) // a and b are integers while (a>0) B- a/2 A a-2 end while return b; i. What is the time complexity of the IterativeFunction pseudocode shown above? ii. What is the space complexity of the IterativeFunction pseudocode shown above? 2. What is the time complexity of the following algorithm (Note that n(n+1) 2,2 n(n+1)(2n+1) 2 and ): Provide both T(n) and order, e(f(n)). int A=0;...
The following is the beginning of an algorithm that accepts an arbitrary collection of numbers from...
The following is the beginning of an algorithm that accepts an arbitrary collection of numbers from the user (who signifies the end of the input with the value -1)(it's Python): values = [] print('Enter positive values (-1 to end):') num = int(input('> ')) (a) Complete the program: Collect the data from the user in the list values, using a loop Once the loop completes, print the total sum and the average Take care to handle the case where the user...
3. Calculate the time complexity of the following algorithm: 1. Initialize sum to 0. I 2. Input the value of n. 3. While i = 0 to n-1 do a. sum=sumti; ; b. Increment i
3) [16 points totall Consider the following algorithm: int SillyCalc (int n) { int i; int Num, answer; if (n < 4) 10; return n+ else f SillyCalc(Ln/4) answer Num Num 10 for (i-2; i<=n-1; i++) Num + = answer + answer; answer return answer } Do a worst case analysis of this algorithm, counting additions only (but not loop counter additions) as the basic operation counted, and assuming that n is a power of 2, i.e. that n- 2*...
3) [16 points total] Consider the following algorithm int SillyCalc (int n) int i; int Num, answer; if (n <= 4) return n 10; else { Num-SillyCalcl n/4) answer = Num + Num + 10; for (i-2; i<-n-1; ++) answer- answer+ answer; return answer; Do a worst case analysis of this algorithm, counting additions only (but not loop counter additions) as the basic operation counted, and assuming that n is a power of 2, i.e. that n- 2* for some...
Can I please have a simple pseudocode algorithm of
this problem.
1 Design an algorithm that will read a series of 50 integers at the terminal. The first integer is special, as it indicates how many more integers will follow. Your algorithm is to calculate and print the sum and average of the integers, excluding the first integer, and display these values to the screen.
Consider the following pseudocode: Algorithm RecursiveFunction (a, b) // a and b are integers if (as1 ) return b; else return RecursiveFunction (a-2, a/2); endif a. What is the time complexity of the RecursiveFunction pseudocode shown above? b What is the space complexity of the RecursiveFunction pseudocode shown above? n(n+1) C. What is the time complexity of the following algorithm (Note that 21-, i = n(n+1)(2n+1). and Σ.,1 ): Provide both T(n) and order, Ofn)). int A=0; for (int i=0;i<n;i++)...
1(5 pts): For each code fragment below, give the complexity of the algorithm (O or Θ). Give the tightest possible upper bound as the input size variable increases. The input size variable in these questions is exclusively n. Complexity Code public static int recursiveFunction (int n)f f( n <= 0 ) return 0; return recursiveFunction (n - 1) 1; for(int i 0i <n; i+) j=0; for ( int j k=0; i; k < < j++) for (int j; m <...
Question No.1 [CLO 1][7 marks] 1. Consider the following pseudocode: Algorithm IterativeFunction (a, b) // a and b are integers while (a>0) B- a/2 A a-2 end while return b; i. What is the time complexity of the IterativeFunction pseudocode shown above? ii. What is the space complexity of the IterativeFunction pseudocode shown above? 2. What is the time complexity of the following algorithm (Note that n(n+1) 2,2 n(n+1)(2n+1) 2 and ): Provide both T(n) and order, e(f(n)). int A=0;...
Most questions answered within 3 hours.
-
Starting with benzene, synthesize 1-phenyl-1-butyne.
Show intermediates and reagents.
asked 42 minutes ago -
Create a 32-run crossed array design with six control factors
and two noise factors such that...
asked 1 hour ago -
A 500g sample of sand from source A has the following amounts
retained on each sieve....
asked 1 hour ago -
In
your own words, please explain the essay by John Keynes wrote "The
End of Laissez...
asked 1 hour ago -
How are the matrix and pixels related? Why are smaller
pixels better for diagnostic quality?
asked 1 hour ago -
2. An AC generator has 80 rectangular loops on
its armature. Each loop is 11 cm...
asked 1 hour ago -
Please help me with this question. Consider Aldi’s current and
potential geographic markets (see Exhibit 4...
asked 1 hour ago -
What are the main components of the fermentation process and
give an explanation of each? Include...
asked 2 hours ago -
Explain which types of cells in the body (belonging to which
organs, etc.) are sensitive to...
asked 2 hours ago -
A single cable supports an 703-kg elevator car. What is the
tension in the cable when...
asked 2 hours ago -
among the three different ways to link CSS specifications to an
HTML document (inline CSS, document...
asked 2 hours ago -
(1) Write the net ionic equation for the reaction that occurs
when equal volumes of 0.191...
asked 2 hours ago