Merge Sort | Sorting Algorithm

Published: 22 May 2022
on channel: Fit Coder

384

In this video, I have explained merge sort.
Merge Sort is a Divide and Conquer algorithm. It divides the input array into two halves, calls itself for the two halves, and then it merges the two sorted halves.

https://github.com/fit-coder/fitcoder...

00:00 Introduction
00:06 Merge Sort
02:05 Pseudo Code
19:07 Merge Sort properties
21:15 C++ Implementation

-------------------------------------------------------------
I live in New Delhi and love explaining programming concepts. I have done M.Tech(BITS Pilani) + B.Tech(PEC, Chandigarh) in Computer Science and am currently working as a software engineer in a MNC.
If you like my content, please like, share my videos and subscribe to the channel.
-------------------------------------------------------------

For Sorting Algorithms, please refer to the below playlist:
   • Sorting Algorithms

For Linked List tutorials, please refer to the below playlist:
   • Linked List

For Binary tree tutorials, please refer to the below playlist:
   • Tree Data Structures

For Binary search tree tutorials, please refer to the below playlist:
   • Binary Search Tree

For in-depth Graph theory and implementation details, please refer to the below playlist:
   • Graph Algorithms

#DataStructure,#sorting,#FitCoder,#Algorithm,#competitiveprogramming,#faang,#codinginterview

On this page of the site you can watch the video online Merge Sort | Sorting Algorithm with a duration of hours minute second in good quality, which was uploaded by the user Fit Coder 22 May 2022, share the link with friends and acquaintances, this video has already been watched 384 times on youtube and it was liked by 12 viewers. Enjoy your viewing!

287