# Category Archives: Data Structure

## DSA – Dynamic Programming

In Divide an Conquer algorithms we use independent operations on sub-parts of a program, and we only store the final result, but in dynamic programming, the operation on one sub-part of the program depend on each other. In dynamic programming, we usually store the result of all the different sub-programs so we could use it… Read More »

## DSA – Divide and Conquer

Divide and conquer is an Algorithm paradigm which we use to solve the big data problems. As by its name itself divide and conquer, this algorithm divides a huge problem into sub-parts and then try to solve the specific subpart to get the solution. We often use the recursion statements in Divide and Conquer algorithms,… Read More »

## DSA – Greedy Algorithms

To solve a problem, we use that algorithm which provides more efficiency and takes less time to run the program, in short, we try to get the optimal solution for a given problem. Greedy Algorithm is a concept or pattern that we follow to design an algorithm. In Greedy Algorithms, we build a solution piece… Read More »

## Asymptotic Analysis

With Time and Space complexity we can analyze an algorithms time taking and space-occupying efficiency, but time complexity and space complexity has their limitation if we take time complexity to analyse a linear search algorithm, the time complexity of the linear search can vary from best time complexity to worst time complexity.  So, to analyse… Read More »

## Algorithms Basics

An algorithm is the steps taken to solve a problem, a problem can be solved using various steps or algorithms. In the programming world, we refer algorithm to represent codes which are capable of giving a proper solution, with the help of code we instruct the computer so it can work according to the code.

## What is Data Structure?

Data Structure is a method which provides a proper structure and syntax to store and organize our data so it could be used efficiently. Data Structures provides a proper format to our data so the data can be inserted and retrieved in an expected way.

## Global vs Local Variables

In programming we often use variables to store some value, basically, variables are the names given to a memory location. In static Programming, we first define a variable then use it, but in dynamic Programming, we do not have to define a variable before using. Here in this article, we have compared two types of… Read More »

## Tree vs Graph

Tree and Graphs both belong to the Non-Linear Non-Primitive Data Structure. Both use nodes to represent many structures which are used to solve the real-world problems. The tree uses a hierarchical model to represent its structure whereas a graph uses a network model to represent its structure.

## Types of Data Structure

In programming languages, we use data structures to provide a proper structure to our data. A data structure is basically used to collect and organize the data on which we are going to perform the operations. For example, we all know what is an Array, one of the famous data structures, Arrays are used to… Read More »

## Float vs Double

In programming languages like C, C++, and Java we have two data types to represent floating points number. In simple words, floating points are those numbers which contain decimal points such as 5.000, 6.2123, etc. Both the real number and decimal number considered under floating points numbers.