Jan 17 · 5 min read · Role: Web Developer | Type: On-Campus | Year: B.E This interview stands out as one of the most comfortable and confidence-boosting experiences from my B.E placement phase. It wasn’t just about answering questions. It was about how I communicated, how...
Join discussion
Jan 10 · 4 min read · Cyclic sort is an in-place and unstable sorting algorithm that is specifically designed to efficiently sort arrays where numbers are in a known range like from 1 to N. How does it work? Let’s take the following array as an example. We need to sort it...
Join discussion
Jan 2 · 4 min read · This article is part of a series focused on translating algorithmic theory into practical code implementations.I am glad if this blog helps beginners, or those transitioning their careers into software engineering, take a step forward. In this articl...
Join discussionNov 29, 2025 · 6 min read · Insertion sort is a simple comparison-based sorting algorithm that sorts by repeatedly inserting elements into their correct position. Let's explore how it works in detail. What is Insertion Sort? Insertion Sort is a comparison sort algorithm. It div...
Join discussion
Nov 25, 2025 · 3 min read · Hey, it’s me again. For my CSC 551 (Algorithm Design) assignment, I had to study the merge operation in merge sort the( O(n) part ), review a few implementations, and then create my own version. I ended up studying three different sorting algorithms,...
Join discussion
Nov 25, 2025 · 5 min read · Selection Sort is a simple sorting algorithm that repeatedly finds the smallest (or the largest) element from the unsorted part and moves it to its correct position. What is Selection Sort? Selection sort is a comparison sort algorithm. It repeatedly...
Join discussion
Nov 23, 2025 · 4 min read · This week of CS50 honestly hit different. Even though I come from a computer science background — and I’ve already studied searching, sorting, and Big-O — Week 3 felt like that moment when you clean your room and suddenly find things you forgot you e...
Join discussion
Nov 23, 2025 · 7 min read · Bubble sort (also called as Sinking Sort and Exchange Sort) is a straightforward sorting algorithm that operates by repeatedly comparing and swapping adjacent elements if they are in the wrong order. What is Bubble Sort? Bubble Sort is a comparison s...
Join discussion
Oct 10, 2025 · 3 min read · Sorting is one of the most common operations in computer science — whether you’re ranking search results, ordering database records, or displaying user lists. Among the many sorting algorithms out there, Quick Sort stands out for its elegant design a...
Join discussion