The queue is a linear list in which we can insert data from one end and delete data from another end. let’s understand it with a simple example, let’s say we have a line of people at the shop waiting for their turn at the counter. so the person who enters first in the line […]
A stack is a linear list where insertion and deletion can perform only at one end. and the end where we perform the operation is called the top of the stack. It uses Last-In-First-Out (LIFO) functionality means the item that inserts last will out first. In the technical form insertion operation in the stack is […]
Sorting is a technique for arranging a set of data in some order like ascending or descending. we have different types of methods to apply to sort in ascending or descending order. and these methods are divided into two categories. Internal Sorting If we have enough memory so that the data that we want to […]
A list of a finite number of homogenous data elements that have the same type is called an array. an array can be classified in terms of dimensions as shown below. Types of the array in Data Structure Linear/One-dimensional arrays Two-dimensional arrays Multi-dimensional arrays How to access elements of the array As we know that […]
Complexity means classifying an algorithm based on the amount of time and space an algorithm needs to specify the growth of time/space requirements as a function of the input size. so we have two things to measure the complexity of the algorithm. Time complexity It measures the running time of the program as a function […]
