Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
Merge Sort Algorithm | Lecture-41 | Java and DSA Foundation course
Play lesson

Java and DSA Foundation Course - Merge Sort Algorithm | Lecture-41 | Java and DSA Foundation course

4.0 (2)
36 learners

What you'll learn

This course includes

  • 108.5 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Keywords

Full Transcript

In this video, we'll be discussing the Merge Sort algorithm in Java. Merge Sort is a divide-and-conquer sorting algorithm that sorts an array by repeatedly dividing it into halves until each half contains only one element, and then merging the halves back together in a sorted manner. We'll go over the basic steps involved in the Merge Sort process and show you how to implement it in Java with code examples. We'll also discuss the time and space complexity of Merge Sort and why it is considered one of the most efficient sorting algorithms. Along with this, we will also look into the substitution method of calculating time complexity, which is also an important concept. Whether you're a beginner or an experienced programmer, this video is perfect for anyone looking to understand the Merge Sort algorithm and its implementation in Java. So be sure to watch till the end to master this important topic! Happy Learning. See you all in the lecture. Access the notes and assignments for this class for free at : https://pwskills.com/course/Cracking-the-Coding-Interview-in-Java---Foundation PW Skills is announcing the launch of the following programs, Binary Batch:- Java-with-DSA-&-System-Design (Java with DSA & System Design) https://pwskills.com/course/Java-with-DSA-and-system-design (Hindi) https://pwskills.com/course/Java-with-DSA-and-System-Design (English) Sigma Batch:- Full-Stack-Web-Development (MERN Stack) https://pwskills.com/course/Full-Stack-web-development (Hindi) https://pwskills.com/course/Full-Stack-Web-Development (English) Impact Batch:- Data-Science-Masters (Full Stack Data Science) https://pwskills.com/course/Data-Science-masters (Hindi) https://pwskills.com/course/Data-Science-Masters (English) Website - https://pwskills.com/ Instagram - https://www.instagram.com/pwcollegewallah/ LinkedIn - https://www.linkedin.com/company/ineuron-ai https://www.linkedin.com/company/physicswallah/ Telegram - https://t.me/SkillsPW Discord - https://discord.gg/m7YSX6Xh Twitter - https://twitter.com/pw__skills TIME STAMPS: 00:00 - Intro 00:25 - Recap 01:35 - Merge Sort 02:26 - Merge Sort Principle 04:40 - Example 14:00 - Merge Function 32:25 - Recursive calls 36:48 - Code 49:30 - Order of recursive calls 55:45 - Time Complexity 01:05:47 - Space Complexity 01:12:25 - Is Merge sort stable? 01:14:37 - Applications of Merge Sort 01:14:58 - Drawbacks of Merge Sort 01:16:00 - Summary 01:17:25 - Substitution method for calculating Time complexity 01:28:10 - Next Lecture 01:28:23 - Outro #Coding #Java #Tutorial #MergeSort #Sorting #Insertion #ProblemSolving #Problem #Solving #PWSkills #CollegeWallah #Solution #DSA #DataStructure #Algorithm

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere