Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 22.3, Problem 22.3.4CP
Program Plan Intro
The following are the steps which need to followed to compute the sum of two number such as “n1” and “n2”,
Step 1:Initialize the variable “sum” as 0.
Step 2:Next use the for loop to itertae the numbers from “n1” to “n2”.
Step 3:Then sum up the values and produce the result.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
What is the time complexity for the following algorithm?
Select one:
a. Θ(n)
b. Θ(1)
c. Θ(n2)
d. Θ(log n)
Two algorithms A, B sort the same problem. When you go through each algorithm and break them down into their primitive operations, each can be represented as below
A = n4 + 100n2 + 10n + 50
B = 10n3 + 2n2 + nlogn + 200
For very large values of n which of these algorithms explain why B
will run in the shortest time to solve the problem
Write an algorithm to find the sum of n numbers. Calculate the timecomplexity of the same in terms of its basic operations.
Chapter 22 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Ch. 22.2 - Prob. 22.2.1CPCh. 22.2 - What is the order of each of the following...Ch. 22.3 - Count the number of iterations in the following...Ch. 22.3 - How many stars are displayed in the following code...Ch. 22.3 - Prob. 22.3.3CPCh. 22.3 - Prob. 22.3.4CPCh. 22.3 - Example 7 in Section 22.3 assumes n = 2k. Revise...Ch. 22.4 - Prob. 22.4.1CPCh. 22.4 - Prob. 22.4.2CPCh. 22.4 - Prob. 22.4.3CP
Ch. 22.4 - Prob. 22.4.4CPCh. 22.4 - Prob. 22.4.5CPCh. 22.4 - Prob. 22.4.6CPCh. 22.5 - Prob. 22.5.1CPCh. 22.5 - Why is the recursive Fibonacci algorithm...Ch. 22.6 - Prob. 22.6.1CPCh. 22.7 - Prob. 22.7.1CPCh. 22.7 - Prob. 22.7.2CPCh. 22.8 - Prob. 22.8.1CPCh. 22.8 - What is the difference between divide-and-conquer...Ch. 22.8 - Prob. 22.8.3CPCh. 22.9 - Prob. 22.9.1CPCh. 22.9 - Prob. 22.9.2CPCh. 22.10 - Prob. 22.10.1CPCh. 22.10 - Prob. 22.10.2CPCh. 22.10 - Prob. 22.10.3CPCh. 22 - Program to display maximum consecutive...Ch. 22 - (Maximum increasingly ordered subsequence) Write a...Ch. 22 - (Pattern matching) Write an 0(n) time program that...Ch. 22 - (Pattern matching) Write a program that prompts...Ch. 22 - (Same-number subsequence) Write an O(n) time...Ch. 22 - (Execution time for GCD) Write a program that...Ch. 22 - (Geometry: gift-wrapping algorithm for finding a...Ch. 22 - (Geometry: Grahams algorithm for finding a convex...Ch. 22 - Prob. 22.13PECh. 22 - (Execution time for prime numbers) Write a program...Ch. 22 - (Geometry: noncrossed polygon) Write a program...Ch. 22 - (Linear search animation) Write a program that...Ch. 22 - (Binary search animation) Write a program that...Ch. 22 - (Find the smallest number) Write a method that...Ch. 22 - (Game: Sudoku) Revise Programming Exercise 22.21...Ch. 22 - (Bin packing with smallest object first) The bin...Ch. 22 - Prob. 22.27PE
Knowledge Booster
Similar questions
- Design an algorithm for computing for any positive integer n. Besides assignment and comparison, your algorithm may only use the four basic arithmetical operations.arrow_forwardFind the values of f(n) and O(f(n)) of the following algorithmsarrow_forwardProve that the time complexity of the pseudocode below is O(Log n). for (int i = 1; i <=n; i *= c) {// some O(1) expressions}for (int i = n; i > 0; i /= c) {// some O(1) expressions}arrow_forward
- What is the time complexity of the following algorithm? Select one: a. O(n3) b. O(n4) c. O(n5) d. O(n2)arrow_forwardWrite an algorithm (psudo-code) for finding the average of six numbers, and the sum of the numbers given.arrow_forwardHere is my question that my professor gave to me as a homework from my algorithm's class. Use asymptotic notations to describe the running times of the nested loops below. You may assume that n is a power of 2.arrow_forward
- Write an algorithm as following:arrow_forwardq11) Find the time complexity for the program code and represent it in Big O notation. int p=3, q=5, r; for(int i=0;i<n;i++) { r= p * q * i; q++; } cout<<r; a. 1 b. O(log n) c. O( n ) d. O(n2)arrow_forwardSimplistic Algorithms with a Fixed Number of Integers (with C++) Write a program that takes three integers and outputs them in reverse order of how they were entered. For example, if the user enters 39, 51, 16 then the program should output 16, 51, 39.arrow_forward
- Computer Algorithms Obtain the complexity of the program fragment below for i <-- 1 to n do k <-- n while K > 1 do K <-- k/2 while (k) end-while end-forarrow_forwardWhat is the time complexity and Big O notation for each of the following code segments? P = 0;for(i=0;i<n;i=i+2){P = P + 1;} f(n) =O(n) =arrow_forwardThe following is an addition problem in binary notation. Each letter represents a unique binary digit. Which letter represents 1 and which represents 0? Design an algorithm for solving problems like this. YXX+ XYX=XYYYarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education