@humblecoder00
Full stack web developer. I enjoy transforming complexity into simplicity.
Nothing here yet.
Nothing here yet.
Oct 19, 2025 · 14 min read · What is Radix Sort? Radix Sort is a clever non-comparison based sorting algorithm that sorts integers by processing individual digits. Think of it like opening a baggage lock with multiple dials. You align the digits one dial at a time. First, you so...
Join discussion
Jul 27, 2025 · 10 min read · What is Counting Sort? Counting Sort is a specialized non-comparison based sorting algorithm that works by counting how many times each number appears in the array, then using those occurrence counts to rebuild the sorted result. Unlike the compariso...
Join discussion
Jun 1, 2025 · 9 min read · What is Quick Sort? Quick Sort is one of the most efficient and widely-used sorting algorithms in computer science. As a "divide and conquer" algorithm, it works by selecting a 'pivot' element and partitioning the array around it. Unlike Merge Sort, ...
Join discussion
Mar 6, 2025 · 7 min read · What is Merge Sort? Merge Sort is a classic "divide and conquer" algorithm in computer science that breaks down a problem into smaller, more manageable parts. Unlike Bubble Sort and Insertion Sort, which slow down as the input size grows, Merge Sort ...
Join discussion
Oct 12, 2024 · 6 min read · What is Insertion Sort? Insertion Sort is another fundamental sorting algorithm in computer science. It builds the final sorted array one item at a time. It's much like sorting a hand of playing cards - you pick up cards one by one and insert each in...
Join discussion