Find big O for given logic

Question

Find big O for given logic

Find Big O for the following code:



for (int i=0; i<n; i++)

for (int j = 0; j<n-i; j++) int a=i;

for (int i = 0; i<n; i++) for (int j = 0; j<nnn; j++)

sum++;

algorithm time-complexity

4 years ago by 123401

1 Answer

Login / Signup to Answer the Question.

Login Signup

**iamabhishek** · Answer 1 · 2021-05-09T12:16:26

Hi, can you please indent the code properly so that it is clear which for loops holds which for loop. Also, is the condition in the 4th loop correct?

C TUTORIAL

C PROGRAMS

INTERVIEW TESTS

EXECUTE CODE

C++ TUTORIAL

C++ PROGRAMS

INTERVIEW TESTS

EXECUTE CODE

PYTHON TUTORIAL

PYTHON HOW TOS

INTERVIEW TESTS

EXECUTE CODE

JAVA TUTORIAL

JAVA CODE EXAMPLES

SPRING TUTORIAL

MORE IN JAVA

COMPUTER ARCHITECTURE

COMPUTER NETWORK

OPERATING SYSTEM

DBMS & SQL

PL/SQL

MongoDB

EXECUTE SQL

ANDROID DEVELOPMENT

GO LANGUAGE

LINUX

DOCKER

HTML TAGS (A to Z)

CSS REFERENCES

SASS/SCSS

KOTLIN

GAME DEVELOPMENT

PHP

GIT GUIDE

JAVASCRIPT

ADVANCED DSA

Find big O for given logic

1 Answer

Login / Signup to Answer the Question.