Doubly Linked List is an extension of Linked List in which we have two pointer variables, so we could traverse back and forth directions. It contains two pointers conventionally named, next and prev, in next we store the address or object of next element or node and in prev, we store the address of the… Read More »
Linked List is a user-defined Data structure, which is a collection of nodes and each node point to another node. Linked list store elements in a sequential manner and each node points to its successor node. Link list often used in the place of the array because some operations of the linked list have less… Read More »
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 »
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 »
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 »
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 »
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.
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 »