Data Structure

1 Complexity of algorithms

Algorithmic complexity is a measure of how long an algorithm would take to complete given an input of size n.

2 Arrays and matrices

An array is a homogeneous one-dimensional data structure in which all its elements are consecutive in memory, and the matrix is an array with more than one dimension.

3 Stack

A stack is a linear data structure that follows the specific order in which operations are performed. The order may be LIFO (Last In First Out) or FILO (First In Last Out).

4 Queue

5 Linked lists

6 Tree

A tree data structure can be defined recursively as a collection of nodes, where each node is a data structure consisting of a value and a list of references to nodes. The start of the tree is the "root node" and the reference nodes are the "children".

7 Graph

A graph is a pictorial representation of a set of objects where some pairs of objects are connected by links. The interconnected objects are represented by points termed as vertices, and the links that connect the vertices are called edges.

8 Sorting algorithms

9 Sort videos