4. Merge sort | Learn DSA series | Part-1 | Sorting Algorithms
Merge sort is to divide the array into two halves, sort each half, and then merge the sorted halves back together. This process is repeated until the entire array is sorted.
Time Complexity : O(nlogn)
Space Complexity : O(n)
Code Link: https://github.com/Ayu-99/Data-Struct...
Please like, share and subscribe if you found the video useful. Feel free to ask in comments section if you have any doubts. :)
#DataStructuresAndAlgorithms
#Leetcode
#interviewpreparation
#AyushiSharma
Merge Sort solution
Merge Sort Leetcode
Merge Sort C++
Merge Sort Java
Merge Sort Python
🔥🔥🔥🔥👇👇👇
Join telegram channel for more updates on placement preparation : https://t.me/AyushiSharmaDiscussionGroup
Checkout the series: 🔥🔥🔥
👉Interview Experiences : • Interview Experiences
👉 Array: • Arrays
👉 Linked List : • Linked List
👉 Heap : • Heap
👉 Recursion : • Recursion
👉 Stack and Queue : • Stack And Queue
👉 Greedy : • Greedy
👉 Dynamic Programming : • Dynamic Programming
👉 Leetcode contests : • Leetcode contests
👉 Leetcode June Challenge : • Leetcode June Challenge
👉 Leetcode July Challenge : • Leetcode July Challenge
LIKE | SHARE | SUBSCRIBE 🔥🔥😊