C++ aligned_alloc() aligned_alloc() like malloc() and calloc() is used for dynamic allocation of memory how it differs from the rest is how it enables the user to dynamically allocate the memory as well as allows us to specify the alignment for the newly allocated memory.
Algorithms Heap vs Binary Tree Today we are going to compare two non linear data structures binary trees and heaps since both are non liner there tend to be confusion regarding both of these usually we will try to remove these confusion.
Graph Algorithms Entropy of Graph In graph theory, entropy is the index for describing the structure and function of a network. Entropy is related to amount of information stored in a graph. This is used in field of computer science to check compression of data as compressed data is more random and hence has higher entropy.
Graph Algorithms Directed vs Undirected Graph In this article, we have explained the differences between Directed and Undirected Graphs based on different attributes such as adjacency matrix, entropy and much more.
C++ Ways to iterate over Vector in C++ STL In this article, we have explored different ways to iterate over Vector in C++ STL. These include techniques like indexing, iterators, range based for loop and much more.