a. Briefly explain why it is necessary to write an algorithm before writing a program. b. Write an algorithm to sum n numbers. c. Find the space complexity in your algorithm in “b” above. d. Write a program using either C or C++ programing language for your algorithm in “b” above. e. Explain your program in “d” above

a. Briefly explain why it is necessary to write an algorithm before writing a program. b. Write an algorithm to sum n numbers. c. Find the space complexity in your algorithm in “b” above. d. Write a program using either C or C++ programing language for your algorithm in “b” above. e. Explain your program in “d” above

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

1. Use C PROGRAMMING LANGUAGE ONLY 2. Use RECURSION type of program 3. Copy and paste your code(no need screenshot) 4. Screenshot the output 5. It should be USER-DEPENDENT 3. Write a C program containing a recursive function that will get the whole number quotient res i of dividing two Integers n and m. (Example if n-4 and m= 3, 4/3 1. Output 1)
-check this code then, In python 3 make a code that shows the performance curve of the algorithm using time measurements 1. Approach: Non recursive: //include necessary header files#include <iostream>using namespace std;//main functionint main(){ int days,buy_on_this_day ,sell_on_this_day; //get number of days as input from user cout<<"Enter number of days: "; cin>>days; int stock_price[days]; for(int i=0;i<days;i++) { cout<<"Enter stock_price"; cin>>stock_price[i]; } int i=0; for(int i=0;i<days-1;i++) { //comparing current price with next day price and finding the minima while(i<days-1 && stock_price[i+1]<=stock_price[i]) i++; if(i==days-1) break; buy_on_this_day =i++; while(i<days && stock_price[i]>= stock_price[i-1]) i++; sell_on_this_day =i-1; cout<<buy_on_this_day <<" : index of the change…
2. Write an algorithm (pseudocode) that inputs three positive real numbers x, y, z and outputs the smallest. How would you modify the algorithm in item # 2 above if some or all of the real numbers are allowed to be negative?
1. Use C PROGRAMMING LANGUAGE ONLY 2. Use RECURSION type of program 3. Copy and paste your code(no need screenshot) 4. Screenshot the output 5. It should be USER-DEPENDENT 3. Write a C propram containing a recrsive function that will get the whole number quotient resull of dividing wo.integers n and m. (Example if ne and m- 3, 4/3 #1. Output 1)
Which of the following is not true of the halting problem?a) It was studied by Alan Turing.b) It is harder than intractable.c) Someday a clever algorithm may be found to solve it.d) It involves a program that analyzes other programs.
Modified coin-row problem:If we modified the coin-row problem, so that you cannot take the adjacent coin, and youcannot take the coin next to the adjacent coin also (see example below), what would thedynamic programming formula F(n) be?Example: A, B, C, D, E, F, G, H, I, JIf A is taken, then B & C cannot be taken, but D (or above D, like E and so on) can be taken.If B is taken, then A, C, D cannot be taken.And so on.
1. Use C PROGRAMMING LANGUAGE ONLY 2. Use RECURSION type of program 3. Copy and paste your code (no need screenshot) 4. Screenshot the output 5. It should be USER-DEPENDENT 4. The Fibonacci series: 0, 1, 1, 2,3,5,8,13,21... begins with terms 0 and 1 and has the property that each succeeding term is the sum of the two previous terms. Write a program containing a recursive function that computes and displays the nth Fibonacci number, given the value for n.
Consider the following program segment: sum := 0 for i:=1 to n for j :=i+1 to n sum := sum + 1 a) Express the final value of sum using summation notation and simplify. b) Write the time complexity of the program in terms of Ⓒ (Theta) notation; you do not need to find constants c and k.
It's urgent please solve quickly. 1. Write in C language. a). Input two integers from 0-9. Compute their sum, difference, product, and their quotient and remainder. Print them out on screen. b). Input two arbitrary integers. Compute their product, then print it on screen.
Which of the following statements is NOT correct? More CPU cycles are required since time is such a difficult concept. The head-spinning nature of space actually helps people remember it better. The number of operations is used as a metric for calculating the time complexity. The most difficult scenario for an algorithm is one in which it must complete the most work.
300-500 words per discussion and avoid plagiarism.a. Explain recursive function.b. Using factorial with your own example, explain a c++ factorial function.c. Using factorial with your own example, explain a c++ Fibonacci Series algorithm.
The computer scientists Richard Conway and David Gries once wrote:The absence of error messages during translation of a computer program is onlya necessary and not a sufficient condition for reasonable (program) correctness.Rewrite this statement without using the words necessary or sufficient. (You are allowedto rewrite it into two sentences if it works better.)