Dual Pivot Quick Sort: Java’s default sorting algorithm for primitive data types.,What happens when we do Arrays.sort() in Java? which sorting algorithm does Java use in the backg...

Dijkstra Python Dijkstra's algorithm in python: algorithms for beginners,Photo by Ishan @seefromthesky on Unsplash Dijkstra's algorithm can find for you the shortest path between t...

Tree traversal [Inorder], Tree is in order. Traverse down the tree to get sorted values using inorder traversal. Inorder traversal is useful to determine if a tree is a binary sear...

How can We implement Data Structures and Algorithms in Backend Frameworks to reach O(log(n)) Run Time ?,Backend frameworks/platforms like Node.js(EcmaScript) and Django(Python). fo...

Efficiently compute permutations, Permutation : each of several possible ways in which a set or number of things can be ordered or arranged. The problem Given several items, it cou...

Pseudo-Random Numbers in Python: From Arithmetic to Probability Distributions,Randomness is something that we tend to take for granted in our daily lives. 'That's so random!' we'll...

A Quick Introduction: Hashing, What is it? Hashing is a method of determining the equivalence of two chunks of data. A cryptographic hash function generates a unique string for any...