1. Consider the below code to sums all the numbers up to the specific number: def sum_using_loop (n): total = 0 for i in range (1, n + 1): total + i return total number = 8 result = sum_using_loop (number) print ("Sum from 1 to", number, ":", result) Figure 1 a) What is the time-complexity of the above code? b) How time-complexity of the above code can be minimized? Justify your answer by

1. Consider the below code to sums all the numbers up to the specific number: def sum_using_loop (n): total = 0 for i in range (1, n + 1): total + i return total number = 8 result = sum_using_loop (number) print ("Sum from 1 to", number, ":", result) Figure 1 a) What is the time-complexity of the above code? b) How time-complexity of the above code can be minimized? Justify your answer by

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

In python don't import libraries
python help Q1: Over or Under Define a procedure over-or-under which takes in a number x and a number y and returns the following: -1 if x is less than y 0 if x is equal to y 1 if x is greater than y *Hint: You can use cond (define (over-or-under x y) 'YOUR-CODE-HERE ) ;;; Tests (over-or-under 1 2) ; expect -1 (over-or-under 2 1) ; expect 1 (over-or-under 1 1) ; expect 0 Q2: Filter Write a procedure filter-lst, which takes a predicate f and a list lst, and returns a new list containing only elements of the list that satisfy the predicate. The output should contain the elements in the same order that they appeared in the original list. (define (filter-lst f lst) 'YOUR-CODE-HERE ) ;;; Tests (define (even? x) (= (modulo x 2) 0)) (filter-lst even? '(0 1 1 2 3 5 8)) ; expect (0 2 8)
N. B. : This topic is from algorithm
Integer num_reading is read from input, representing the number of integers to be read next. Read the remaining integers from input and insert each integer at the front of reading_list at position 0.
Module/Week 2 ASSIGNMENT (INPUT/OUTPUT)The number of permutations of a set of n items taken r at a time is given by the following formulan !⁄r !(n-r)!: where n! is the factorial of n, r! is the factorial of r, and (n-r)! is the factorial of the result of n-r. The factorial of a number n can be solved using the following formula: 〖n!=e〗^(-n) n^n√2πn. If there are 18 people in your class and you want to divide the class into programming teams of 3 members, you can compute the number of different teams that can be arranged using this formula (n !⁄r !(n-r)!). Write a C++ program that determines the number of potential team arrangements. You will need to use the double type for this computation. Use the Lab Template you set-up last week, proper formatting, and appropriate comments in your code. The output must be labeled clearly and formatted neatly. Submit C++ Programming Assignment 2 by 11:59 p.m. (ET) on Monday of Module/Week 2.
Please follow all the steps given
The function sum_evens in python takes a list of integers and returns the sum of all the even integers in the list. For example: Test Result print(sum_evens([1, 5, 2, 5, 3, 5, 4])) 6 print(sum_evens([5, 5, -5, -5])) 0 print(sum_evens([16, 24, 30])) 70
in C++ use this function to calcul the range: function range step Specified value of y y = 0.05*x3+6sin(3x)+4 From -2.5 to 2.5 0.5 -2 The program will calculate average value of y for the given range. To find the average, usestd::accumulate using algorithm header and divide by the number of elements. The output must be write with the result:Average value of function y for the given range is : ;
Objective: Write syntactically correct while/for loops Given a list of numbers and a number n, return the sum of the first n elements in the list. Assume n is less than or equal to the length of the list. For example, given [1, 1, 1, 5] and n=3, the function should return 3. (i.e. 1+1+1) user_code.py 1 # starter code 2 def sum_to_n(numbers, n): 3 4 & in 5 # your code here (replace pass with your code) *
Create a list L containing at least 10 values ranging from j to k. Using a for loop, code a function that will compute and display the following list: L_out[0] = L[0] L_out[i] = L[i] + L[i-1] if i is odd and i is not equal to 0 L_out[i] = L[i] * 3 if i is even and i is not equal to 0 where L[i] represents the value stored in L at the position i. Example: L ‘(2 3 4 5) L_out ‘(2 5 12 9)
code in python The function print_reverse takes one parameter, L, which is a list. The function then prints the items in the list in reverse order, one item per line, WITHOUT changing the value of L. Write the function definition. Note 1: This function does NOT get anything from standard input. Note 2: This function DOES, however, print to standard output. Note 3: You should NOT return anything from this function (let it return None by default). Hint: Some ideas for iterating over a list in reverse order are given here. For example: Test Result L = ['apple', 'banana', 'cherry'] Lcopy = L[:] return_value = print_reverse(L) if return_value != None or L != Lcopy: print("Error") cherry banana apple L = ['happy'] Lcopy = L[:] return_value = print_reverse(L) if return_value != None or L != Lcopy: print("Error") happy L = [] Lcopy = L[:] return_value = print_reverse(L) if return_value != None or L != Lcopy: print("Error")
P Y T H O N: Singly Linked ListIMPORTANT NOTE: Make sure that the time complexity of the program is O(n)