Strengthening DSA and JavaScript Fundamentals with Merge Sort

🚀 Day 18:– JavaScript + DSA (Java) Today’s learning was focused on strengthening my understanding of Data Structures & Algorithms and revising JavaScript fundamentals. 🔹Java – Merge Sort I explored the Merge Sort algorithm in depth and understood how it works internally: ->Uses the Divide and Conquer technique. ->Recursively divides the array into smaller subarrays. ->Merges the sorted subarrays to form the final sorted array. ->Time Complexity: O(n log n) in best, average, and worst cases. ->Stable Sorting Algorithm ✅ Not an In-Place Algorithm because it requires extra space during merging. Understanding the step-by-step splitting and merging process helped me clearly see why the time complexity becomes O(n log n). 🔹 JavaScript Revision Also spent time revising core JavaScript concepts to keep my fundamentals strong while continuing my programming journey. #100DaysOfCode #Java #JavaScript #DSA #MergeSort #CodingJourney #LearningInPublic

  • text

To view or add a comment, sign in

Explore content categories