📄️ Intro to Runtime Complexity
What is Runtime Complexity?
📄️ Formal (Mathematical) Definition
Remember that there's quite a bit of math involved in computer science! Computer science is basically a field of mathematics, so you'll probably run into a lot of mathematical theory in coding. Get used to it!
📄️ Runtime Analysis Examples
Linear Search
📄️ Big Omega and Big Theta
Alright, we've learned a decent bit about Big O. But have you ever heard someone mention Big $\Theta$ or Big $\Omega$? What are they?
📄️ Comparing Different Algorithms
When choosing data structures for your project, it's important to know the runtimes of the different operations you complete on the data structure. Right now, we'll take a look at and compare the runtimes of Arrays and LinkedLists.
📄️ Space Complexity
Space complexity refers to the amount of memory space required by an algorithm or a program to execute as a function of the input size. It is a measure of how efficiently an algorithm utilizes memory resources.
📄️ Space Analysis Examples
Linear Search