What is the time complexity of the following code: for( int i = n; i> 0; i-- ) { for( int j = 1:j < n ; j++ ) { for( int k = 100 ; k >= 1; k/= 2){ // constant number of operations } } } O a. O(n?) O b. O(n³logn) O. O(n?logn) O d. O(nlogn)
What is the time complexity of the following code: for( int i = n; i> 0; i-- ) { for( int j = 1:j < n ; j++ ) { for( int k = 100 ; k >= 1; k/= 2){ // constant number of operations } } } O a. O(n?) O b. O(n³logn) O. O(n?logn) O d. O(nlogn)
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
Transcribed Image Text:What is the time complexity of the following code:
for( int i = n; i> 0; i-- ) {
for( int j = 1:j <n;j++ ) {
for( int k = 100 ; k >= 1; k/= 2){
// constant number of operations
}
}
}
O a. O(n?)
O b. O(n³logn)
O. O(n?logn)
O d. O(nlogn)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
