Latest Articles

Some of my recent thoughts on design, development, and the tech industry.

Animated Beam: Visual Connections Between Elements in Vue

Animated Beam draws a glowing, animated path between two elements — expressing flow, interaction, and connection through motion.

BlurReveal: Smooth Fade and Blur Animation for Vue & Nuxt

A component that introduces a soft, cinematic reveal motion as elements scroll into view. Inspired by the natural rhythm of great animations.

Mastering Topological Sort: A Comprehensive Guide with C Implementation

Learn Topological Sort in detail with step-by-step explanations, pseudo code, and C implementation in this comprehensive guide.

Understanding Dijkstra’s Algorithm: A Comprehensive Guide with Implementation in C

Dive into Dijkstra's Algorithm with this detailed guide. Learn its logic, pseudo code, and C implementation step-by-step.

Understanding Counting Sort: Algorithm, Implementation, and Applications in C

Explore Counting Sort, a fast and efficient non-comparative sorting algorithm. Learn its logic, implementation in C, and practical uses.

Mastering Heap Sort: Algorithm, Implementation, and Applications in C

Discover the fundamentals of Heap Sort, a powerful sorting algorithm. Learn its logic, implementation in C, and real-world applications.

Mastering Minimum Spanning Tree (MST): Detailed Guide with C Implementation

Learn Minimum Spanning Tree (MST) algorithms with step-by-step explanations, pseudo code, and C implementation in this comprehensive guide.

Understanding Radix Sort: Algorithm, Implementation, and Applications in C

Learn Radix Sort, a powerful non-comparative sorting algorithm. Discover its step-by-step logic, C implementation, and practical uses.

Quick Sort Uncovered: Efficient Sorting with Detailed C Implementation

Dive into Quick Sort, with step-by-step guides, C code insights, and complexities explained simply.

Efficient Sorting with Merge Sort: A Step-by-Step Guide to Algorithm and C Implementation

Explore Merge Sort in-depth, with clear C code examples, and learn why it's favored for efficient data sorting.

Mastering Selection Sort: A Comprehensive Guide to Its Implementation and Efficiency

Unlock the essentials of Selection Sort, including C implementation, complexity analysis, and practical applications.

Mastering Bubble Sort: Simplifying Sorting Algorithms in Programming

Learn Bubble Sort in C with our easy-to-follow guide, perfect for beginners looking to understand sorting algorithms.

Mastering Insertion Sort: A Comprehensive Guide for Beginners

Unlock the essentials of Insertion Sort in programming with step-by-step guidance on its algorithm, C implementation, and complexities.

Jump Search Simplified: Efficient Searching in Sorted Arrays

Jump Search is a streamlined search technique for large, sorted arrays, offering quick and efficient performance.

Optimizing Word Searches with Tries: A Comprehensive Guide

Explore trie search in C to enhance string handling with fast insertions and queries, ideal for dynamic data sets.

Efficient Data Retrieval with Hash Tables in C: A Practical Guide

Discover how to implement and utilize hash tables in C for rapid data access, ideal for developers and programmers.

Mastering Depth First Search: A Programmers Guide to DFS in C

Learn Depth First Search (DFS) in C with clear examples and explanations, ideal for complex graph traversal.

Interpolation Search Explained: A Fast Search Method for Uniformly Distributed Data

Explore how Interpolation Search optimizes search times in uniformly distributed datasets, making it ideal for large databases.

Exploring Breadth First Search: Essential Techniques for Programmers

Learn how Breadth First Search in C optimally traverses graphs and trees, suitable for both new and seasoned programmers.

Mastering Linear Search: A Comprehensive Guide for Beginners

Explore the linear search algorithm in C, a simple method to find values in unsorted arrays.

Efficient Techniques to Identify a Unique Element in an Array

Discover effective methods to detect the unique element in arrays with practical C implementations.

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

Explore how Binary Search in C provides an efficient solution for searching in sorted arrays, enhancing data handling in programming.

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

A clear, practical guide to Heap Sort: how it works, step-by-step explanation of heapify and heapSort, time and space complexity analysis, plus a complete C++ implementation you can run and adapt.

String compression using Huffman Coding Algorithm

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

Find the minimum of cost function using Gradient Descent Algorithm

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

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

Learn practical, efficient methods to find duplicate numbers in arrays — from hash-table and sorting approaches to brute-force and cycle-detection techniques — with code examples and trade-offs for each.

How to find the length of a number

This article shows different approaches to finding the length of a number.
rahulv.dev | Built with Nuxt UI • © 1970