MadeEasy Workbook: Programming & DS - Programming In C

Question

how it will be solve plz someone help?

Comments

is it O(n²) ?

here's my logic.

For i =0 , while loop will run for n times.

i=1, while loop n-1 times

i=2, while loop n-2 times

and so on...

i= n-1, while loop 0 times.

hence complexity will be n+n-1+n-2....0

n(n+1)/2 = O(n²)

---

Yes its TC is O( n2) ).

Becuase it has nothing to deal with elemets of array.