[{"data":1,"prerenderedAt":360},["ShallowReactive",2],{"term-t\u002Ftime-complexity":3,"related-t\u002Ftime-complexity":349},{"id":4,"title":5,"acronym":6,"body":7,"category":330,"description":331,"difficulty":332,"extension":333,"letter":334,"meta":335,"navigation":54,"path":336,"related":337,"seo":343,"sitemap":344,"stem":347,"subcategory":6,"__hash__":348},"terms\u002Fterms\u002Ft\u002Ftime-complexity.md","Time Complexity",null,{"type":8,"value":9,"toc":324},"minimark",[10,15,19,23,26,30,313,317,320],[11,12,14],"h2",{"id":13},"eli5-the-vibe-check","ELI5 — The Vibe Check",[16,17,18],"p",{},"Time complexity is how the time your algorithm takes grows as the input gets bigger. Does it take twice as long when you double the data? Ten times longer? The same? Understanding time complexity helps you avoid writing code that works fine on 10 items but melts down on 10 million.",[11,20,22],{"id":21},"real-talk","Real Talk",[16,24,25],{},"Time complexity is a measure of how the runtime of an algorithm scales with input size (n), expressed in Big O notation. It counts the number of operations rather than actual wall-clock time, making it hardware-independent. Analysis covers best case (Ω), average case (Θ), and worst case (O). Critical for choosing the right algorithm at scale.",[11,27,29],{"id":28},"show-me-the-code","Show Me The Code",[31,32,37],"pre",{"className":33,"code":34,"language":35,"meta":36,"style":36},"language-javascript shiki shiki-themes material-theme-lighter material-theme material-theme-palenight","\u002F\u002F Time complexity examples:\n\n\u002F\u002F O(1) — HashMap lookup:\nconst user = userMap.get(id); \u002F\u002F same speed for 10 or 10M users\n\n\u002F\u002F O(n) — Finding max in unsorted array:\nconst max = arr.reduce((a, b) => Math.max(a, b));\n\n\u002F\u002F O(n log n) — Array sort:\narr.sort((a, b) => a - b); \u002F\u002F JavaScript's built-in sort\n\n\u002F\u002F O(n²) — Bubble sort (avoid for large n):\nfor (let i = 0; i \u003C n; i++)\n  for (let j = 0; j \u003C n; j++) { \u002F* compare *\u002F }\n","javascript","",[38,39,40,49,56,62,96,101,107,165,170,176,215,220,226,269],"code",{"__ignoreMap":36},[41,42,45],"span",{"class":43,"line":44},"line",1,[41,46,48],{"class":47},"sHwdD","\u002F\u002F Time complexity examples:\n",[41,50,52],{"class":43,"line":51},2,[41,53,55],{"emptyLinePlaceholder":54},true,"\n",[41,57,59],{"class":43,"line":58},3,[41,60,61],{"class":47},"\u002F\u002F O(1) — HashMap lookup:\n",[41,63,65,69,73,77,80,83,87,90,93],{"class":43,"line":64},4,[41,66,68],{"class":67},"spNyl","const",[41,70,72],{"class":71},"sTEyZ"," user ",[41,74,76],{"class":75},"sMK4o","=",[41,78,79],{"class":71}," userMap",[41,81,82],{"class":75},".",[41,84,86],{"class":85},"s2Zo4","get",[41,88,89],{"class":71},"(id)",[41,91,92],{"class":75},";",[41,94,95],{"class":47}," \u002F\u002F same speed for 10 or 10M users\n",[41,97,99],{"class":43,"line":98},5,[41,100,55],{"emptyLinePlaceholder":54},[41,102,104],{"class":43,"line":103},6,[41,105,106],{"class":47},"\u002F\u002F O(n) — Finding max in unsorted array:\n",[41,108,110,112,115,117,120,122,125,128,130,134,137,140,143,146,149,151,154,157,159,162],{"class":43,"line":109},7,[41,111,68],{"class":67},[41,113,114],{"class":71}," max ",[41,116,76],{"class":75},[41,118,119],{"class":71}," arr",[41,121,82],{"class":75},[41,123,124],{"class":85},"reduce",[41,126,127],{"class":71},"(",[41,129,127],{"class":75},[41,131,133],{"class":132},"sHdIc","a",[41,135,136],{"class":75},",",[41,138,139],{"class":132}," b",[41,141,142],{"class":75},")",[41,144,145],{"class":67}," =>",[41,147,148],{"class":71}," Math",[41,150,82],{"class":75},[41,152,153],{"class":85},"max",[41,155,156],{"class":71},"(a",[41,158,136],{"class":75},[41,160,161],{"class":71}," b))",[41,163,164],{"class":75},";\n",[41,166,168],{"class":43,"line":167},8,[41,169,55],{"emptyLinePlaceholder":54},[41,171,173],{"class":43,"line":172},9,[41,174,175],{"class":47},"\u002F\u002F O(n log n) — Array sort:\n",[41,177,179,182,184,187,189,191,193,195,197,199,201,204,207,210,212],{"class":43,"line":178},10,[41,180,181],{"class":71},"arr",[41,183,82],{"class":75},[41,185,186],{"class":85},"sort",[41,188,127],{"class":71},[41,190,127],{"class":75},[41,192,133],{"class":132},[41,194,136],{"class":75},[41,196,139],{"class":132},[41,198,142],{"class":75},[41,200,145],{"class":67},[41,202,203],{"class":71}," a ",[41,205,206],{"class":75},"-",[41,208,209],{"class":71}," b)",[41,211,92],{"class":75},[41,213,214],{"class":47}," \u002F\u002F JavaScript's built-in sort\n",[41,216,218],{"class":43,"line":217},11,[41,219,55],{"emptyLinePlaceholder":54},[41,221,223],{"class":43,"line":222},12,[41,224,225],{"class":47},"\u002F\u002F O(n²) — Bubble sort (avoid for large n):\n",[41,227,229,233,236,239,242,244,248,250,252,255,258,260,263,266],{"class":43,"line":228},13,[41,230,232],{"class":231},"s7zQu","for",[41,234,235],{"class":71}," (",[41,237,238],{"class":67},"let",[41,240,241],{"class":71}," i ",[41,243,76],{"class":75},[41,245,247],{"class":246},"sbssI"," 0",[41,249,92],{"class":75},[41,251,241],{"class":71},[41,253,254],{"class":75},"\u003C",[41,256,257],{"class":71}," n",[41,259,92],{"class":75},[41,261,262],{"class":71}," i",[41,264,265],{"class":75},"++",[41,267,268],{"class":71},")\n",[41,270,272,275,277,279,282,284,286,288,290,292,294,296,299,301,304,307,310],{"class":43,"line":271},14,[41,273,274],{"class":231},"  for",[41,276,235],{"class":71},[41,278,238],{"class":67},[41,280,281],{"class":71}," j ",[41,283,76],{"class":75},[41,285,247],{"class":246},[41,287,92],{"class":75},[41,289,281],{"class":71},[41,291,254],{"class":75},[41,293,257],{"class":71},[41,295,92],{"class":75},[41,297,298],{"class":71}," j",[41,300,265],{"class":75},[41,302,303],{"class":71},") ",[41,305,306],{"class":75},"{",[41,308,309],{"class":47}," \u002F* compare *\u002F",[41,311,312],{"class":75}," }\n",[11,314,316],{"id":315},"when-youll-hear-this","When You'll Hear This",[16,318,319],{},"\"The time complexity is O(n²) — it'll be too slow past 10,000 records.\" \u002F \"Profile it to confirm the time complexity matches theory.\"",[321,322,323],"style",{},"html pre.shiki code .sHwdD, html code.shiki .sHwdD{--shiki-light:#90A4AE;--shiki-light-font-style:italic;--shiki-default:#546E7A;--shiki-default-font-style:italic;--shiki-dark:#676E95;--shiki-dark-font-style:italic}html pre.shiki code .spNyl, html code.shiki .spNyl{--shiki-light:#9C3EDA;--shiki-default:#C792EA;--shiki-dark:#C792EA}html pre.shiki code .sTEyZ, html code.shiki .sTEyZ{--shiki-light:#90A4AE;--shiki-default:#EEFFFF;--shiki-dark:#BABED8}html pre.shiki code .sMK4o, html code.shiki .sMK4o{--shiki-light:#39ADB5;--shiki-default:#89DDFF;--shiki-dark:#89DDFF}html pre.shiki code .s2Zo4, html code.shiki .s2Zo4{--shiki-light:#6182B8;--shiki-default:#82AAFF;--shiki-dark:#82AAFF}html pre.shiki code .sHdIc, html code.shiki .sHdIc{--shiki-light:#90A4AE;--shiki-light-font-style:italic;--shiki-default:#EEFFFF;--shiki-default-font-style:italic;--shiki-dark:#BABED8;--shiki-dark-font-style:italic}html pre.shiki code .s7zQu, html code.shiki .s7zQu{--shiki-light:#39ADB5;--shiki-light-font-style:italic;--shiki-default:#89DDFF;--shiki-default-font-style:italic;--shiki-dark:#89DDFF;--shiki-dark-font-style:italic}html pre.shiki code .sbssI, html code.shiki .sbssI{--shiki-light:#F76D47;--shiki-default:#F78C6C;--shiki-dark:#F78C6C}html .light .shiki span {color: var(--shiki-light);background: var(--shiki-light-bg);font-style: var(--shiki-light-font-style);font-weight: var(--shiki-light-font-weight);text-decoration: var(--shiki-light-text-decoration);}html.light .shiki span {color: var(--shiki-light);background: var(--shiki-light-bg);font-style: var(--shiki-light-font-style);font-weight: var(--shiki-light-font-weight);text-decoration: var(--shiki-light-text-decoration);}html .default .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .dark .shiki span {color: var(--shiki-dark);background: var(--shiki-dark-bg);font-style: var(--shiki-dark-font-style);font-weight: var(--shiki-dark-font-weight);text-decoration: var(--shiki-dark-text-decoration);}html.dark .shiki span {color: var(--shiki-dark);background: var(--shiki-dark-bg);font-style: var(--shiki-dark-font-style);font-weight: var(--shiki-dark-font-weight);text-decoration: var(--shiki-dark-text-decoration);}",{"title":36,"searchDepth":51,"depth":51,"links":325},[326,327,328,329],{"id":13,"depth":51,"text":14},{"id":21,"depth":51,"text":22},{"id":28,"depth":51,"text":29},{"id":315,"depth":51,"text":316},"general","Time complexity is how the time your algorithm takes grows as the input gets bigger. Does it take twice as long when you double the data? Ten times longer?","intermediate","md","t",{},"\u002Fterms\u002Ft\u002Ftime-complexity",[338,339,340,341,342],"Big O","Space Complexity","Algorithm","Performance","Optimization",{"title":5,"description":331},{"changefreq":345,"priority":346},"weekly",0.7,"terms\u002Ft\u002Ftime-complexity","AAUoY6f3MGbT7wJTiMEvFgZOeMe2XbJWi2T9k7F-9dE",[350,354,357],{"title":340,"path":351,"acronym":6,"category":330,"difficulty":352,"description":353},"\u002Fterms\u002Fa\u002Falgorithm","beginner","An algorithm is just a step-by-step recipe for solving a problem. Sort a list? There is an algorithm. Find the shortest path? Algorithm. Make a sandwich?",{"title":338,"path":355,"acronym":6,"category":330,"difficulty":332,"description":356},"\u002Fterms\u002Fb\u002Fbig-o","Big O notation is how we describe how fast (or slow) an algorithm gets as the input grows. O(1) means instant no matter the size.",{"title":339,"path":358,"acronym":6,"category":330,"difficulty":332,"description":359},"\u002Fterms\u002Fs\u002Fspace-complexity","Space complexity is how much extra memory your algorithm uses as the input grows.",1776518318978]