The latest articles on Forem by Ryan Heo (@ryanheo). https://forem.com/ryanheo https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F2163251%2Fe8a665c7-336a-4f24-916a-b01042b9efee.JPG https://forem.com/ryanheo en Ryan Heo Fri, 20 Dec 2024 21:17:59 +0000 https://forem.com/ryanheo/algorithm-big-o-1g7h https://forem.com/ryanheo/algorithm-big-o-1g7h <h2> Time Complexity </h2> <h3> Big O </h3> <ol> <li>Best case scenario (Omega)</li> <li>Average case scenario (theta)</li> <li>Worst case scenario (O)</li> </ol> <p>We always talk about the worst case, Big O.</p> <h4> 1. O(n) </h4> <p>Proportional Graph<br> Drop Constants</p> <h4> 2. O(n^2) </h4> <p>Exponential Graph<br> Drop Non-dominant</p> <h4> 3. O(1) </h4> <p>Flat Graph</p> <h4> 4. O(log(n)) </h4> <p>Efficient than O(n) and O(n^2)<br> Quite Flat</p> <h4> 5. O(n log(n)) </h4> <p>Some Sorting Algorithm</p> algorithms complexity