Big-O, complexity
Simple code-oda time, space complexity-a padichu sollalaam, O(1), O(log n), O(n), O(n log n), O(n²)-a compare pannalaam, adhai vachchu code odaadhukku munnaadiye vegamaana approach-a pick pannalaam.
Beginner 3 · Data and toolsabout 2 hours5 sections
Short-aa sonna
Big-O notation input valara valara oru algorithm-oda velai evvalavu valarudhu-nu solludhu. O(1) appadiyae irukkum, O(n) input-oda serndhu valarum, O(n²) input-oda square-oda valarum.
Idhu yen mukkiyam
100 rows-ku okay-aa irukkura code 10 lakh-ku manikkanakkaa edukkalaam. Idhai munnaadiye paakka Big-O udhavum; ovvoru coding interview-layum unga answer-oda complexity-a sollanum, adha improve pannanum-nu kekkuvaanga.
Sign up free to read the whole lesson
The rest of this lesson: 5 parts, video lessons, the best course, practice and a quick check. It is free, takes a few seconds and needs no card.
Accounts are for learners aged 18 and over. Under 18? The quick answer and the first part of every lesson stay open: browse lessons by topic.
Related
Data structures and algorithmsBeginner 3: Data and toolsVideo lessonsBig-O notationHash mapBinary search