---
title: "Discussion on \"The Complexity of Time Complexity\" | Hashnode"
description: "Discussion on \"The Complexity of Time Complexity\". for (int i=1; i<=n; i*=2) { \n  for (int j=0; j<i; j++) { \n    for (int k=0; k<=n; k+=2) { \n      // Any O(1) operation \n    } \n    for (int k=1; k<n; k*=2) { \n      // Any O(1) operation\n    } \n  } \n}\n\nIf you can truly understand the TC of the above ..."
url: "https://hashnode.com/posts/the-complexity-of-time-complexity/6818d137eb94565f7b65e2d1"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [The Complexity of Time Complexity](https://the-complexity-of-time-complexity.hashnode.dev/the-complexity-of-time-complexity?utm_source=hashnode&utm_medium=feed)

for (int i=1; i<=n; i\*=2) { for (int j=0; j<i; j++) { for (int k=0; k<=n; k+=2) { // Any O(1) operation } for (int k=1; k<n; k\*=2) { // Any O(1) operation } } } If you can truly understand the TC of the above ...

May 5, 2025 · 6 min read · the-complexity-of-time-complexity.hashnode.dev  
Read the article

-   [#chaicode](https://hashnode.com/tag/chaicode)
-   [#time-complexity](https://hashnode.com/tag/time-complexity)
-   [#dsa](https://hashnode.com/tag/dsa)
-   [#loops](https://hashnode.com/tag/loops)
-   [#nestedloops](https://hashnode.com/tag/nestedloops)
-   [#cpp-ck4ra5k7300nlv2s1jbkdp2qh](https://hashnode.com/tag/cpp-ck4ra5k7300nlv2s1jbkdp2qh)

## Written by

[GirdhaR](https://hashnode.com/@girdhar)

@girdhar

  
[View profile](https://hashnode.com/@girdhar)

one day or day one

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
