Could you please help me find the time complexity for the following codes? Thank you. 13.for(i1; i <= 3n; i+=2) {for(jn; j > 0; j2) {-=// 2 assignments}for(k1; k < 2i; k++) {// 3 assignments}}14.for (int i1; i <= n; i ++) {for (int j=1; j <= 2i; j += 2) {// 5 assignments}for (int k=1; k <= 3n+1; k ++) {// 2 assignments}}

Answered: please help me find the time complexity…

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

Related questions

Question

100%

Could you please help me find the time complexity for the following codes? Thank you.

13.
for(i
1; i <= 3n; i+=2) {
for(j
n; j > 0; j
2) {
-=
// 2 assignments
}
for(k
1; k < 2i; k++) {
// 3 assignments
}
}
14.
for (int i
1; i <= n; i ++) {
for (int j=1; j <= 2i; j += 2) {
// 5 assignments
}
for (int k=1; k <= 3n+1; k ++) {
// 2 assignments
}
}

Expert Solution

Step 1

Time complexity: We know that the term time complexity refers to the total time taken by the program for completion. It is usually expressed as a big-O notation. The worst-case Time complexity of an algorithm because is the maximum time taken for any input size. Most common as we see here there are nested for loops and usually, the one-loop nested in another will cause O(n²). So, let's take deep dive into it and find what is the time complexity for the following functions.

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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