Introduction to Data Structures & Algorithms

Big Oh notation is an asymptotic notation used to describe the upper bound on the growth rate of a function. In algorithm analysis, it tells us the worst-case rate at which the running time or space requirement of an algorithm grows as the input size increa...

Asymptotic analysis of an algorithm refers to defining the mathematical framing of its run-time performance. It is a technique used to evaluate the performance of an algorithm in terms of input size, without measuring the actual running time. Using asymptot...

When we analyze algorithms, we need a way to measure and compare their efficiency (time and space) without depending on machine speed, programming language, or hardware. Asymptotic notation provides a mathematical framework to describe the behavior of an al...

The complexity of an algorithm is a measure of the amount of time and/or space required by an algorithm as a function of the size of the input. It helps us evaluate and compare algorithms in terms of their efficiency. --- Time complexity measures the amount...

The complexity of an algorithm f(n) gives the running time and/or the storage space required by the algorithm in terms of n, where n is the size of the input data. It is used to measure the efficiency of an algorithm. There are two main factors that decide ...

Big O notation is a mathematical notation that describes the limiting behaviour of a function when the argument tends towards a particular value or infinity. In computer science, Big O notation is used to classify algorithms according to how their running t...

Definition: An Abstract Data Type (ADT) is a type or a class for objects whose behaviour is defined by a set of values and a set of operations. It does not specify how data will be organized in memory and what algorithms will be used for implementing the op...

--- Dynamic Memory Allocation is the process of allocating memory to variables or data structures at runtime (during program execution) rather than at compile time. In static memory allocation, the size of memory is fixed and determined before the program r...

Structure: A structure is a user-defined data type in C/C++ that creates a data type used to group items of possibly different types into a single type. Each member of a structure has its own separate memory location. Union: A union is also a user-defined d...

--- Dynamic memory allocation is the process of allocating memory to variables and data structures at runtime (during program execution), rather than at compile time. It is a key component of the variable part of space complexity, meaning the memory require...