Identify the big-O time complexity of each of the following functions: void f1(int n) { for(int i=0; i<(3*n+n); ++i) { cout << i << endl; } for(int i=0; i<(10*n); ++i) { cout << i << endl; } } void f2(int n) { if(n==0) { return; } f2(n-1); f2(n-3); } void f3(int n) { for(int i=0; i
Identify the big-O time complexity of each of the following functions: void f1(int n) { for(int i=0; i<(3*n+n); ++i) { cout << i << endl; } for(int i=0; i<(10*n); ++i) { cout << i << endl; } } void f2(int n) { if(n==0) { return; } f2(n-1); f2(n-3); } void f3(int n) { for(int i=0; i
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
Related questions
Question
Identify the big-O time complexity of each of the following functions:
void f1(int n) {
for(int i=0; i<(3*n+n); ++i) {
cout << i << endl;
}
for(int i=0; i<(10*n); ++i) {
cout << i << endl;
}
}
void f2(int n) {
if(n==0) { return; }
f2(n-1);
f2(n-3);
}
void f3(int n) {
for(int i=0; i<n; ++i) {
for(int j=0; j<n; ++j) {
for(int k=0; k<n; ++k) {
cout << i << endl;
}
}
}
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
