Category Archives: Data Structure

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.

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.