Rahul Vashishtha - Rahul's Blog

Rahul Vashishtha

Heap Sort Algorithm: Step by Step Guide with C++ Code

Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure to sort elements. It is one of the most efficient sorting algorithms, with a time complexity of O(n*logn) and a space complexity of O(1). In this blog, we will discuss the Heap sort

Binary Search Algorithm: A Powerful Tool for Searching Large Data Sets

Binary search is one of the most important algorithms in computer science, and is used to search for a specific value in a sorted array or list. It is an efficient algorithm that works by repeatedly dividing the search interval in half, eliminating the half where the target value cannot

Find the minimum of cost function using Gradient Descent Algorithm

Understand Gradient Descent Algorithm and find minimum of cost function using this algorithm.

String compression using Huffman Coding Algorithm

Understand the Huffman Coding Algorithm and implement String Compression using this algorithm.

A Step-by-Step Guide to Easily Find Duplicate Numbers Inside an Array

A Step-by-Step Guide to Easily Find Duplicate Numbers Inside an Array

Are you trying to figure out how to find duplicate numbers from inside an array? If yes, then you’ve come to the right place! In this blog, I’ll be giving a step-by-step guide on how to easily find duplicate numbers inside an array. I’ll also be discussing

Photo by Mitchell Luo

How to find the length of a number

This article shows different approaches to finding the length of a number.