a) O O(n)b) O O(logn)c) O O(nlog n)d) OO(n?) (n square) 11 - The code segment below hastime complexity?for (int i=0; i

Here in this question we have given a code segment and we have to compute the time complexity.. So…

Answered: 11 - The code segment below has time…

Engineering

Computer Science

11 - The code segment below has time complexity? for (int i=0; i

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 20SA

See similar textbooks

Related questions

Q: PYTHON RECURSIVE FUNCTION Write a python program that lists all ways people can line up for a photo…

A: Here I have created a function named createList(), which takes the name list as input parameter and…

Q: Implement the recursive function int ordered_pairs(int al], int size). This function returns true if…

A: given data is

Q: Write a complete program in C++ that counts the number of duplicates in a list of integer numbers.

A: ANSWER: C++ Programming Language: C++ is a cross-stage language that can be utilized to create…

Q: Manats of execution of d, a, k first are the result of executing d in C + + #include #include main()…

A: PROGRAM CODE: #include<iostream>#include<conio.h>using namespace std;main(){ int…

Q: 3. Write a C++ program that implements the following three algorithms and times for various values…

A: For n = 1000000 Algo A - Aglo B - (n = 10000) otherwise took too long Algo C -

Q: a)Write a C++ recursive function that takes an array of words and returns an array that contains all…

A: Answer a: #include<bits/stdc++.h>using namespace std; // c++ function taht take words array…

Q: 19 - The code segment below has time complexity ? sum=0; for (int i=; i<n; i*=2){ sum++;

A: Answer to the above question is in step2.

Q: Write C++ program that implements the histogram of the given array. 1: X is 1 by 10000 integer…

A: Code : #include <bits/stdc++.h>using namespace std; void printHistogram(int arr[], int n){…

Q: 8. Create a recursive function intToBin(n) that takes a non-negative integer and returns a string of…

A: ALGORITHM:- 1. Take input for the integer from the user. 2. Pass it to the recursive function to…

Q: Create a recursive function with arguments N and K in python 3 that does the following…

A: The code is

Q: Generate the code for a recursive function: closest(n: int, 1st: list)--> int The function returns…

A: Here, I have to write a python solution to the above equation.

Q: Write a C++ program that declares and initializes an array of the following elements: 10 15 4 -7 4…

A: I have given an answer in step 2.

Q: Write Java code and a C++ Code for the problem given below as:

A: So, the basic approach in this code is to count out the triplets. In those triplets, the sum of any…

Q: Calculate the result of f(n) using recursion. Depict the recursive tree and demonstrate the resu…

A: i. f(n)=n*f(n-1),where f(0)=1 Given N=8 Result for N=8 8×7×6×5×4×3×2×1×1=40320 Recursion tree

Q: Analyze the time complexity of the code segment and find their Big-O. int myfunction4 (int n, int…

A: myfunction4 is the function and here we check condition and value of n decides when to exit from…

Q: Compute f(6) for the recursive function below. def f(n): if n == 0: return 1 if n == 1: return 2…

A: def f(n): # the user define function if n == 0: # if n = 0 return 1 #…

Q: Write a recursive function to calculate the sum of numbers from 0 to 10 Expected Output: 55

A: The problem is based on the basics of recursion as it is based on finding the sum of 10 numbers from…

Q: Study the definition of function funArray and answer the question below. void funArray (double List…

A: Function is called as pass by value and original values doesn't gets reflected

Q: Question 19. The following function f uses recursion: def f(n): if n <- 1 return n else return…

A: GIVEN: The recursive function given is the program to find the Fibonacci series. CODE: def f(n):…

Q: What is the time complexity of following code. Show the time complexity of each statement below and…

A: Language is one of the most widely used programming language which has been used to create different…

Q: Write python3 code for problem: Sort an array of 0s, 1s and 2s Given an array of size N containing…

A: Move the same members from the beginning to the end and the center is less than the length. If the…

Q: Submission Date: 10-June-2022, 11:59 PM Question 1 [Marks 4] An arithmetic sequence is a sequence of…

A: binary tree data structure whose internal nodes each store a key big than all the keys in the…

Q: 1. Generalized harmonic numbers. Write a program GeneralizedHarmonic.java that takes two integer…

A: PROGRAM: //Defining the class public class GeneralizedHarmonic{ //Defining the main()…

Q: Assume you have a list of numbers, A, and A[i] (i>=1) represents the ith element of the list. Now…

A: Algorithm step1: intilizes element of list A Step2: take input n step3:-call function f(A,n) step4:…

Q: Question 2: Show the time complexity of each statement below and the final running time. [2 N void…

A: According to the information given:- We have to find out the time complexity of each statement.

Q: Write a word problem that corresponds to the following model for subtraction Missing addend

A: Explanation: An addend is indeed an integer that is appended to some other number, and it is…

Q: Question 1: Write a C program that do the following: write a recursive function that receives a…

A: PROGRAM CODE: #include <stdio.h>#define MAX_SIZE 100 void replaceAll(char * str);int main(){…

Q: Write a C++ program that declares and initializes an array of the following elements: 10 15 4 -7 4…

A: To convert int to float int a = 3;float b = (float)a; We should declare min as greatest integer…

Q: Explain the functionality of below recursive functions. static void fun1(int n) { int i = 0; if…

A: Recursion : => Recursion happens when something is described in terms of itself or of its type.…

Q: Please right 2 different simple program;

A: The first question will be answered only. Here we divide the input number into digits existing at…

Q: n C language, write a program which creates an array of N elements of type integers. Output and…

A: The program is written in C Language. Check the program screenshot for the correct indentation.…

Q: Question 5: 2.1 Sum Problem View Past Answers Given a positive number n, the sum of all digits is…

A: Given:

Q: 1. In quiz1.c implement digit_sum_base function using recursion that calculates the digit sum of a…

A: File name: “quiz1.h” //Declare the recursive function int digit_sum_base(int, int); Screenshot:…

Q: Q3\ write a C++ program to make changes for M numbers using N coins items. and print the process of…

A: Program in C++ for coin change

Q: The Fibonacci algorithm is a famous mathematical function that allows us to create a sequence of…

A: In the below step I have pasted the code and commented it please go through it.

Q: Write a recursive function that returns the smallest integer in an array. Write a test program that…

A: PROGRAMMING APPROACH: Define the necessary header file using namespace. Define the main() method.…

Q: Write the question also in c ++ language. Question 2.An aray containing the given n-element integers…

A: NOTE: The problem is written in C++ language. Please resubmit the question if you a solution in the…

Q: int i-1,j; while(1){ j-i; i=j+i; What is the time complexity of above loop.

A: Time complexity of a loop is the time dependency of the termination of loop on the loop variable.

Q: Answer must be solved Recursively neighbor(n, prev) Takes a positive integer n and a default…

A: Code is given below: def neighbor(n,prev=-1): if n<10: #base case: if…

Q: Create a program applying the concept of Recursion use in java and c++ and explain each step of the…

A: #include <iostream> using namespace std; int recurSum(int n) { if (n <= 1)…

Q: Q1. Write a Java program that takes a positive odd integer n and returns the sum of odd integers…

A: public static int oddSum(int n){ //check if n is lees than 1 if(n<1){ return 0;…

Q: Find the Cyclomatic Complexity of the following code segment: int average (int[ ] value, int min,…

A: The cyclomatic complexity of a code section is the quantitative measure of the number of linearly…

Q: 2. Consider the following function: def func1(n): output = 1 for i in range (1,n): output *= i…

A: The question has been answered in step2

Q: Write a program in C or Java to sort elements of array in ascending order.

A: C code to sort an array in ascending order is in step 2.

Q: Find the Cyclomatic Complexity of the following code segment: int average (int[ ] value, int min,…

A: Given:

Q: In Java Write a program using recursion to display all valid (i.e. properly open and closed)…

A: Required: Write a program using recursion to display all valid (i.e. properly open and closed)…

Q: Analyze the time complexity of the code segment and find their Big-O.

A: GIVEN: void myfunction1(int n){ for(int i=0; i < n; i++) { for(int j=0; j < n; j++) {…

Q: In java Reprogram the following iterative function with recursion. int f(int N) { int…

A: The equivalent recursive function for the given iterative function is as follows, //Define recursive…

Q: 4. CodeW X For func X C Solved b Answer x+ https://codeworkou... ... [+) CodeWorkout X271: Recursion…

A: Ans : The main code using recursion is : public int recursiveMin(int numbers[], int startIndex){…

Q: 1. Write a recursive definition for the set of bit string that have m ones followed by n zeros for…

A: It is defined as a recursive procedure or routine is one that has the ability to call itself. This…

Concept explainers

Declaring and Defining the function

A set of statements, which performs a particular task is called a function. The program gains modularity by using function. The application is quite easy to understand, read, and edit when they are created with functions. The developer/programmer creates a function and uses main() to call the function. Once the function gets executed, the control is transferred to the main program.

Question

100%

a) O O(n)
b) O O(logn)
c) O O(nlog n)
d) O
O(n?) (n square)

11 - The code segment below has
time complexity?
for (int i=0; i<n; i++)
sum++;
for (int i=0; i<n; i++)
sum--;

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

MULTIPLE FUNCTIONS AND RECURSIVE FUNCTIONS Use #include<stdio.h> Implement the picture shown below.
4. Design a recursive function that accepts an integer argument, n, and prints every second number from n down to a minimum of 0. Assume that n is always a positive integer.
Please right 2 different simple program; 1: write a function romenNumber that takes an integer between 1 & 1000 as an input argument and returns same number as a Romen-numeral 2: write a function named mathProduction that takes two matrixes (2-dimensional lists of floats ) and return their cross-products. The function should return "Matrix sizes don't match" if the row and column sizes of inputs doesn't allow a cross product
T/F 9. As loop variables and recursive solutions are also not used for iterative solutions, the recursive solution generally makes memorization more effective (use fewer stored) than the corresponding iterative solution.
Complete the following function using pass-by-reference: void findMax(int &max, int a) which assigns value ‘a’ to ‘max’ if a > max. Write a pseudo-code then implement a program in C language to find the maximum in a sequence of numbers using this function.
Using comments in c explaining how each code works line by line. The whole program is given below. Don't delete anything. For example // #include calls upon the c library #include #define N 16 typedef int fix_matrix[N][N]; /* Set all diagonal elements to a[i] + val */ void fix_set_diag(fix_matrix A, int val) { for( int i=0;i
15. Write a program to implement and test the algorithm that you designed for Exercise 15 of Chapter 1. (You may assume that the value of . In your program, declare a named constant PI to store this value.)
//Can you please debug this program. Thank you #include<stdio.h>#include<stdlib.h> //This function takes n and k and computes n using Pascal’s Rule.long choose(int n, int k); //This functions below create a memoization table containing//long values of dimension (n+1)×(k+1) long chooseWithMemoization(int n, int k); //This is a new recursive function that also takes the table as a parameter.//When the function needs to compute (n , k )it checks the table first, and//if the value has already been comput(is not -1) then it returns that value. long chooseWithMemoizationRecursive(int n, int k, long **tableau); int main(int argc, char **argv) {//variable declaration int n; int k; scanf("%d",&n); scanf("%d",&k ); long choice = -1;//printing out the out put choice = chooseWithMemoization(n,k); printf("choose(%d,%d) = %ld\n", n, k, choice); return 0;} /** * This function takes n and k and computes n using Pascal’s Rule.*/long choose(int…
Reversing an Array1. Describe the definition of recursive function.oBase case(s)oRecursive case(s)2. Write the code.
C++ (a) Use iteration (b) Use recursion (c) Convert the function that you wrote in part (b) into a template function. The template function should work for arrays of any type.
2. Sum: a recursive function that computes the sum of integers 1, 2, 3, …., n for a given number n. So Sum(6) should return 1 + 2 + 3 + 4 + 5 + 6 , i.e. 21.sum(n) = n + sum(n-1)
c++ program write a recursive function to find the factorial of a number. main points : 1) n and r are stored in two parallel arrays. 2) you have to read the arrays n and r at run time. 3) compute nCr for each corresponding terms in the array n and r and display it properly formatted 4) also in the program you should print the current date and time using the library functions