Revisiting Bubble Sort for a deeper understanding of sorting algorithms

🔽 Day 166 of #200DaysOfCode Today, I continued sharpening my fundamentals by implementing Bubble Sort in descending order — without using JavaScript’s built-in .sort() method. 💡 While sorting might look simple on the surface, it is one of the most essential concepts in programming — powering search algorithms, intelligent ordering systems, real-time data processing, and more. By writing this logic manually, I reinforced: ✅ How comparisons work inside loops ✅ Value swapping and index manipulation ✅ Time complexity analysis (O(n²) for Bubble Sort) ✅ Why optimized sorting algorithms matter in bigger datasets 🌱 Every advanced concept in Data Structures & Algorithms is built on these fundamentals — and revisiting them helps improve clarity, confidence, and coding discipline. 🔁 Progress in programming isn’t linear — it’s iterative. Master the basics, and everything else becomes easier. #JavaScript #166DaysOfCode #BubbleSort #Algorithms #WebDevelopment #DSA #CodingChallenge #ProblemSolving #LearnInPublic #DeveloperMindset

📚 Understanding Time & Space Complexities (The “Big O” Basics) When we write code, we care about two things: 1️⃣ How much time our program takes. 2️⃣ How much memory (space) it uses. Here’s a quick, no-jargon guide to the different types of complexities: ⚡ O(1) – Constant: No matter how big your input is, the time stays the same. Example: Accessing array[0] or checking if a number is even. 📈 O(log n) – Logarithmic: Time increases slowly as inputs grow. Example: Binary Search (it keeps cutting the problem in half). 🚶 O(n) – Linear: Time grows directly with your data size. Example: Looping through an array once to find the largest number. 🧩 O(n log n) – Linearithmic: A bit slower than linear, but still efficient. Example: Merge Sort or Quick Sort. 💥 O(n²) – Quadratic: Gets slower quickly, often due to nested loops. Example: Bubble Sort or Insertion Sort. 🧮 O(n³) – Cubic: Even slower — usually three nested loops. 🧠 O(2ⁿ) – Exponential: Doubles in time with each extra input. Example: Recursive Fibonacci. 😰 O(n!) – Factorial: The slowest! Used in complex tasks like checking all permutations (e.g., Traveling Salesman Problem). The smaller your “Big O,” the faster and more efficient your code is. 🚀 Learning this helps you think like a problem solver — not just a coder! #DSA #BigO #LearningInPublic #Coding #Education #ProblemSolving #FrontendDevelopment #JavaScript #WebDev

🔥 𝗠𝗮𝗰𝗵𝗶𝗻𝗲 𝗖𝗼𝗱𝗶𝗻𝗴 — 𝗙𝗶𝗹𝗲 𝗦𝘁𝗿𝘂𝗰𝘁𝘂𝗿𝗲 𝗣𝗿𝗼𝗯𝗹𝗲𝗺 Got inspired after watching Akshay Saini 🚀’s Machine coding series — and decided to take on a fun machine coding challenge: Building a file explorer from scratch. 𝗣𝗿𝗼𝗯𝗹𝗲𝗺 𝗦𝘁𝗮𝘁𝗲𝗺𝗲𝗻𝘁 👇 ✅ Render a tree-structure from JSON (folders/files with expand-collapse) ✅ Add new files or folders dynamically at any level ✅ Keep everything sorted alphabetically — folders first, then files 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲𝘀 𝗜 𝘂𝘀𝗲𝗱:  1. Recursive function to render nested structures.  2. React Context API to manage shared states (active folder, add mode, etc).  3. Pure immutable state updates using structured cloning for clean re-renders.  4. Smart sorting logic — folders and files handled separately and merged elegantly. 💻 𝗟𝗶𝘃𝗲 𝗱𝗲𝗺𝗼 : https://lnkd.in/gJapscTm 🔗 𝗚𝗶𝘁𝗛𝘂𝗯 (𝗰𝗼𝗱𝗲): https://lnkd.in/gCnpu39P 🎥 𝗔𝗸𝘀𝗵𝗮𝘆'𝘀 𝗬𝗧 𝘃𝗶𝗱𝗲𝗼: https://lnkd.in/gXch9JKE 𝗗𝗿𝗼𝗽 𝘆𝗼𝘂𝗿 𝘁𝗵𝗼𝘂𝗴𝗵𝘁𝘀 👇 — 𝘄𝗼𝘂𝗹𝗱 𝗹𝗼𝘃𝗲 𝘁𝗼 𝗱𝗶𝘀𝗰𝘂𝘀𝘀 𝗱𝗶𝗳𝗳𝗲𝗿𝗲𝗻𝘁 𝗮𝗽𝗽𝗿𝗼𝗮𝗰𝗵𝗲𝘀! #ReactJS #MachineCoding #FrontendDevelopment #JavaScript #CleanCode #WebDevelopment #SoftwareEngineering #CodingInterview #Learning

🔍 Day 171 of #200DaysOfCode Today, I implemented a function to check whether a specific value exists in an array — without using built-in methods like .includes(). This challenge helped strengthen my understanding of: • Array traversal using loops • Conditional comparisons • Manual search logic • Returning Boolean results effectively 🌍 Though simple, this concept plays a big role in real-world applications like: ✅ Searching records in a dataset ✅ Validating user inputs ✅ Checking access permissions ✅ Matching values in dynamic arrays 💡 Every “basic” problem hides a core principle that drives advanced algorithms. Mastering small steps leads to giant leaps in logic building! #JavaScript #171DaysOfCode #ProblemSolving #LearnInPublic #BackToBasics #WebDevelopment #CodingChallenge #DeveloperMindset #LogicBuilding

🧠 Day 11: Merge Sort — Divide, Conquer & Combine Today in my #DSA journey, I explored Merge Sort — a powerful divide-and-conquer algorithm that breaks problems into smaller parts and merges them efficiently. It’s faster than basic sorts like Bubble or Insertion Sort, especially for large datasets. ⚡ Let’s go 🚀 #JavaScript #DSA #LearnInPublic #Developers 1️⃣ Problem Statement: Given an array of integers, sort them in ascending order using Merge Sort . Approach: Divide the array into two halves until each subarray has one element. Recursively sort both halves. Merge the sorted halves into a single sorted array. 💡 Intuition: Just like organizing scattered papers into smaller piles, sorting each pile, and merging them back neatly — Merge Sort does the same with numbers. Time Complexity: O(n log n) Space Complexity: O(n) 2️⃣ Problem Statement: Given two sorted arrays, merge them into a single sorted array using the Merge Sort merge logic. Approach: Use two pointers (one for each array). Compare elements and insert the smaller one into a new array. Continue until all elements from both arrays are merged. 💡 Intuition: Imagine merging two sorted playlists 🎵 — you take the smallest next song from either list and keep merging until both are combined in perfect order. Time Complexity: O(n + m) Space Complexity: O(n + m)

💡 Brute Force vs. Mathematical Logic — Which One Wins? ⚔️ Tried a small coding challenge today: 👉 Find two numbers in an array whose sum equals a target (classic 2-sum problem 😎). code: https://lnkd.in/gtRVzcZY 🧠 Observation: Both give the same result — but the mathematical approach is cleaner, faster, and more efficient 💪 Sometimes, it’s not just about solving the problem… It’s about solving it smartly. 🚀 #JavaScript #CodingFun #LogicBuilding #ProblemSolving #WebDevelopment #LearnToCode #Efficiency #DeveloperLife

🚀 Mastering Array Recursion: Flattening Nested Structures Ever run into a deeply nested array and wished there was a clean, elegant way to make it flat? While built-in methods like Array.prototype.flat() are great, understanding the recursive approach is a fantastic way to sharpen your JavaScript fundamentals and master complex data structures! The Challenge 🤯 We want to transform an array like this: [1, [2, 3], [4, [5, 6]], 7] Into a flat array: [1, 2, 3, 4, 5, 6, 7] The Recursive Solution 🧠 Why Bother with Recursion? 🤔 Fundamental Skill: Recursion is a core computer science concept. Mastering it helps you better understand algorithms, tree traversals, and dynamic programming. Readability: For naturally recursive problems (like nested arrays or tree structures), the recursive solution often mirrors the problem's structure, making the code surprisingly elegant and readable. Interview Readiness: This is a classic coding interview problem designed to test your command of JavaScript and core algorithm design. Keep challenging yourself with these fundamentals! Happy coding! #JavaScript #Recursion #WebDevelopment #CodingChallenge #SoftwareEngineering

In his latest Data Science Lab article, Dr. James McCaffrey presents a complete, end-to-end demonstration of ANOVA (analysis of variance) using JavaScript. The walkthrough shows how to compute and interpret F-statistics and p-values with sample data, explaining each mathematical step in code.

📚 Day 09 of my #100DaysLogicChallenge Topic: Stack Data Structure in JavaScript 🧩 💡 Continuing my Data Structures journey (after Singly & Doubly Linked Lists), today I implemented one of the most fundamental and powerful structures — the Stack! A Stack follows the LIFO (Last In, First Out) principle — just like a pile of books 📚, where the last one placed is the first to be removed. 🧠 What I learned & implemented: Created a Stack class in JavaScript from scratch Implemented core methods: push(item) → Add element to the top pop() → Remove top element peek() → View top element without removing isEmpty() → Check if stack is empty size() → Return stack length Understood stack operations both conceptually and practically ⚙️ Use Cases of Stack: Undo/Redo functionality Browser back/forward navigation Expression evaluation (like postfix or parentheses validation) Function call management in recursion 📘 Connected DSA Topics So Far: 🧩 Day 02: Singly Linked List 🔁 Day 05: Doubly Linked List 🧱 Day 09: Stack in JavaScript 👉 Slowly building up a strong foundation in Data Structures with pure logic and no external libraries. 🎯 Key Takeaways: Stack is simple yet powerful for solving many real-world problems Reinforces logic behind memory management and recursive calls Helps in strengthening algorithmic thinking 🚀 Every new DSA concept adds another brick to the foundation of logic. Building strong fundamentals — one day, one structure at a time 💪 #100DaysLogicChallenge #JavaScript #LogicBuilding #DataStructures #Day09 #Stack #ProblemSolving #LearnByBuilding #CodingChallenge #WebDevelopment #DSA #ProgrammingFundamentals

 #100daysCODINGchallenge Date 27 - 10 - 2025 Day 65 of #100DaysOfCoding challenge! 🚀 Aaj maine seekha JavaScript Primitive Data Types ke baare mein Primitive Data Types hote hain String Text data ke liye ( "Hello World") Number Numeric values ( 25, 3.14) Boolean True/False values ( true, false) Undefined Jab variable declare hota hai par value assign nahi hoti Primitive ka matlab hota hai simple aur immutable (unchangeable) data type Mujhe ye concept kafi interesting laga kyunki ye JavaScript ke base foundation ko samjhne mein help karta hai #JavaScript #CodingJourney #LearnWithMe #100DaysOfCode #FrontendDevelopment