Learn about Complexities
In Data Structures and Algorithms (DSA), the main goal is to solve problems effectively and efficiently. To determine the efficiency of a program, we look at two types of complexities:
- Time Complexity: This tells us how much time our code takes to run.
- Space Complexity: This tells us how much memory our code uses.
To compare efficiencies of algorithms, we use asymptotic notation, a mathematical tool that estimates time based on input size without running the code. It focuses on the number of basic operations in the program.
Notation | Description |
---|---|
Big-O (Ο) | Describes the worst-case scenario, providing an upper time bound of algorithm. |
Omega (Ω) | Describes the best-case scenario, offering a lower time bound of algorithm. |
Theta (θ) | Represents the average complexity of an algorithm of algorithm. |
The most commonly used notation for code analysis is Big O Notation, providing an upper limit on the running time or memory usage concerning the input size.
Related Topics:
Learn Data Structures and Algorithms | DSA Tutorial
Data Structures and Algorithms (DSA) refer to the study of methods for organizing and storing data and the design of procedures (algorithms) for solving problems, which operate on these data structures. DSA is one of the most important skills that every computer science student must have. It is often seen that people with good knowledge of these technologies are better programmers than others and thus, crack the interviews of almost every tech giant. This DSA tutorial aims to help you learn Data Structures and Algorithms (DSA) quickly and easily.
Table of Content
- DSA Full Form
- What is DSA?
- How to learn DSA?
- Learn Data Structures
- Array
- String
- Linked Lists
- Matrix/Grid
- Stack
- Queue
- Heap
- Hash
- Tree
- Graph
- Learn Algorithms
- Searching Algorithm
- Sorting Algorithm
- Divide and Conquer Algorithm
- Greedy Algorithms
- Recursion
- Backtracking Algorithm
- Dynamic Programming
- Graph Algorithms:
- Pattern Searching
- Mathematical Algorithms
- Geometric Algorithms
- Bitwise Algorithms
- Randomized Algorithms
- Branch and Bound Algorithm
- Learn about Complexities
- Practice Problem Cheat Sheets
Contact Us