Dayeonyeonnan.hashnode.dev·Sep 11, 2024시간 복잡도, 공간 복잡도공간 복잡도 프로그램을 실행시켰을 때 필요로 하는 자원(메모리) 공간의 양 총 필요 저장 공간 고정 공간(알고리즘과 관계 없는 공간): 코드 저장공간, 단순 변수 및 상수 가변 공간(알고리즘의 실행과 관련 있는 공간): 실행 중 동적으로 필요한 공간 공간 복잡도는 컴퓨터 저장공간의 기술 발달로 시간복잡도에 비해 상대적으로 중요하지 않음. 시간 복잡도 특정 알고리즘이 어떤 문제를 해결하는데 걸리는 시간 문제를 해결할 때 성능,...CSbig o
SAI GOUTHAMgouthamcodes.hashnode.dev·Aug 14, 2024The Foundation of Efficient Code: Understanding Big O Notation and Complexity💡 DSA-1.1 Welcome to Week 1 of our series, where we dive into the essentials of writing efficient and scalable code. In this series, I’ll be using Python as my primary language, but don’t worry—this content is language-agnostic. Whether you’re a s...Data Structures and Algorithmsbig o
Nadim Anwarblog.nadim.in·Jul 14, 2024What Is Big O Notation? A Beginner's ExplanationBig O notation is a mathematical concept used to describe an algorithm's performance or complexity. It shows how the runtime or space needs of an algorithm increase as the input size grow. If the pace of an algorithm is not known, it will be difficul...Data Structures and Algorithms (DSA)#BigONotation
Parveen Kumarparveenpal.hashnode.dev·Jun 4, 2024Power of Big(O) in computer scienceTo become a better engineer, you shouldn't underestimate the power of big(O) Big(O) is really helpful to write efficient and scalable code. It is a method to calculate how fast an algorithm will run when we increase input size. The speed of an algori...DSA
Munir Abdullahimunirwrites.hashnode.dev·May 26, 2023Mastering the Basics: Understanding the Rules of Big-O NotationBig-O Notation is a very important concept in the field of computer science. With the knowledge of Big-O Notation, we can improve the performance and scalability of algorithms. An algorithm's growth rate can be managed as the input size increases. In...3 likes·149 reads#big o notation
Brian Enos Otienobrianenosotieno.hashnode.dev·Mar 15, 2023Time Complexity AnalysisIntroduction Time complexity is a term used in computer science to describe the amount of time required by an algorithm or a program to execute, as a function of the input size. It is often measured in terms of the number of operations performed by t...2 likes·250 readsData Structures & Algorithms#big o notation
Musab Habeebmusab19.hashnode.dev·Jan 23, 2023Time Complexity of Algorithms For BeginnersIntroduction Have you ever tried to send a file to a friend who lives far away from you before? How did you send it? You might decide to send it electronically via email or any social media platform or you decide to transport yourself to your friend...1 like·48 readsGeneral Programming
Anusree Anilkumaranusree-anilkumar.hashnode.dev·Dec 20, 2022Big O in Data Structures and AlgorithmO(1) - constant (does not contain loops) O(log n) - searching operations O(n) - Linear, loops (for, while) O(n*log(n)) - Sorting operations O(n^2) - two nested loops O(2^n) - recursive algorithm O(n!) - Adding a loop for every element Rules: ...42 readsdata structures
Sivaraman Arumugamsivayuvi79.hashnode.dev·Sep 27, 2022DSA -Analysiswe have some steps to construct an algorithms, In those steps analysis is the last one. But before start the Problem solving we need to study the analysis part very well then only we can see our algorithms works well or not. To find optimized code we...1 like·41 readsDSA using PythonTime Complexity
Hazem Khairyhazemkh.hashnode.dev·Sep 21, 2022No, Big O notation is not equivalent to saying "worst case scenario"One may be tempted to believe that Big O is just a notation for the worst case analysis. After all, Big O is an "upper bound" notation. Isn't the upper bound equivalent to the worst case? For the sake of simplicity, let's assume our algorithms rely ...1 like·147 readsalgorithms
