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 2, 2025 · 18 min read · 🧠 Binary Search Core Idea Binary Search works on sorted arrays.It repeatedly divides the search interval in half — compare the target with the middle element: If equal → found If smaller → search left If larger → search right Time Complexity B...
Join discussion
Aug 20, 2025 · 4 min read · Prologue Sorting is one of the most essential operation in computer science. Whether it’s arranging numbers, organizing records in a database, or optimizing search operations, sorting plays a key role in improving efficiency. Among many sorting algor...
Join discussion
Jul 2, 2025 · 5 min read · I remember reading a programming book which said, “Write Code That Is Clean And Reusable“. I always wondered what “Clean And Reusable Code“ meant. As a beginner in programming, it was really out of my level to understand the difference between brute-...
Join discussion
Jun 25, 2025 · 3 min read · 🌀 1. Quick Sort Divide-and-conquer: pick a pivot, partition the array into elements ≤ pivot (left) and > pivot (right), then recursively sort the two halves. Average-case efficiency comes from balanced partitions. 1.1. Time Complexity Average / ...
Join discussion
Jun 13, 2025 · 8 min read · 1. Sorting an array of strings Use CaseBehavior list.sort()Sorts array in-place (modifies original array, case-sensitive) [...list].sort()Sorts a shallow copy of the array (original remains unchanged) list.sort((a,b)=>a.localeCompare(b))Case...
Join discussion
Jun 12, 2025 · 2 min read · Sorting algorithms are a fundamental part of computer science, and today I focused on understanding Merge Sort — one of the most efficient and widely used sorting algorithms. In this blog post, I’m documenting what I’ve learned through both explorati...
Join discussionJun 4, 2025 · 5 min read · Hello everyone! Today, we're tackling "Sort List" (LeetCode #148), a problem that asks us to sort a given linked list. While we could convert the linked list to an array, sort it, and then convert it back, the most efficient approach, especially for ...
Join discussionApr 7, 2025 · 3 min read · Sorting algorithms don’t have to be scary. In this article, we’ll break down Merge Sort in a friendly and visual way with simple Python code and easy-to-follow steps — perfect for beginners and curious minds alike. 📚 Table of Contents 🧠 What is M...
Join discussion
