Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
e and Find the big-O time complexity of each of the foll

e and Find the big-O time complexity of each of the foll

Database System Concepts
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
icon
Related questions
Question

please i need e and f

 

Question 1: Analyze and Find the big-O time complexity of each of the following code fragments: (0) while (i <= n) { (b) int i = n while (i > 0) { } System.out.println("*"); i = 2* i; ONLINE ASSIGNMENT -1 for (int j = 0; j<n; j++) System.out.println(""); i = 1 / 2: (c) while (n > 0) { for (int j = 0; j<n; j++) System.out.println(""); (d) for (int i = 0; i<n; i++) // loop 1 for (int j =i+1; j > i j--) // loop 2 for (int k = n k > j; k--) // loop 3 System.out.println(""); (e) void foo(int n) { if (n <= 1) return; do OhOne (); // doOhOne () runs in 0(1) time foo (n/2); foo (n/2); (f) void foo(int n) { if (n <= 1) return; do OhN(); // doOhN() runs in O(n) time foo (n/2); foo (n/2);
Transcribed Image Text:Question 1: Analyze and Find the big-O time complexity of each of the following code fragments: (0) while (i <= n) { (b) int i = n while (i > 0) { } System.out.println("*"); i = 2* i; ONLINE ASSIGNMENT -1 for (int j = 0; j<n; j++) System.out.println(""); i = 1 / 2: (c) while (n > 0) { for (int j = 0; j<n; j++) System.out.println(""); (d) for (int i = 0; i<n; i++) // loop 1 for (int j =i+1; j > i j--) // loop 2 for (int k = n k > j; k--) // loop 3 System.out.println(""); (e) void foo(int n) { if (n <= 1) return; do OhOne (); // doOhOne () runs in 0(1) time foo (n/2); foo (n/2); (f) void foo(int n) { if (n <= 1) return; do OhN(); // doOhN() runs in O(n) time foo (n/2); foo (n/2);
Expert Solution
Step 1

Solution - In the given question, we have to find the time complexity for (e) and (f) part.

steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Binary numbers
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
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS