Dynamic programming is one of the algorithmic paradigm that solves many problems that are failed under other paradigms such as Divide and Conquer, Greedy approach etc. The idea
Hashing has the fundamental problem of collision, two or more keys could have same hashes leading to the collision. Open addressing also called as Close hashing is the
Hashing has the fundamental problem of collision, two or more keys could have same hashes leading to the collision. Separate Chaining or Open Hashing is one of the
Hashing is an approach which provides searching operation in constant running time. There are many applications that require predominantly dictionary operations(Insert, Delete, Search). One of the approaches could
In our previous post Application of Graph – Shortest Path Problems we discussed the findings of the optimal path or the shortest path between the nodes of a graph. We talk
An array is known as the contiguous run of elements while a pointer is an address pointing variable. A pointer could represent the same array. int arr[5]; int
In C programming all the input-output functions provided under C standard are thread safe. But, POSIX standard provides Multi-thread unsafe functions such as getchar_unlocked(). This method is faster
How to use the Precedence and Associativity of the operators smartly is one of the important part of C programming. Precedence talks about the priority among the different
AVL tree is a self balancing binary search tree, where difference of right subtree and left subtree height to a node is at most 1. A self-balancing binary
