Merge Sort Algorithm in C++ Programming | (C++ Program) | Part - 2 | Sorting Algorithms - DSA

Подписаться 248 тыс.

Просмотров 93 тыс.

50% 1

Support Simple Snippets by Donations -
Google Pay UPI ID - tanmaysakpal11@okicici
PayPal - paypal.me/tanmaysakpal11
--------------------------------------------------------------------------------------------- Implement merge sort sorting algorithm using C++ programming language. In this tutorial we will write a program to implement merge sort algorithm.
If you don't know merge sort algorithm working, please check the the part - 1 where we discuss the working of merge sort algorithm.
Full DSA playlist - • Introduction to Data S...
Full Code & Theory article - simplesnippets...
C++ Programming Tutorials for Beginners Course - • Introduction to Comput...
Simple Snippets Official Website -
simplesnippets....
Simple Snippets on Facebook -
/ simplesnippets
Simple Snippets on Instagram -
/ simplesnippets
Simple Snippets on Twitter -
/ simplesnippet
Simple Snippets Google Plus Page -
plus.google.co...
Simple Snippets email ID -
simplesnippetsinfo@gmail.com
For More Technology News, Latest Updates and Blog articles visit our Official Website - simplesnippets....
#mergesort #sortingalogrithms #dsa #divideandconcquer #algorithms

Опубликовано:

27 сен 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 133

@oshinsaini255 4 года назад

I now realize that I never really understood merge sort until I saw your video. Thank you for such a wonderful explanation :)

@SimpleSnippets 4 года назад

Happy to hear that! Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇

@mannnanshaikh7608 Год назад

u teach better than Apna College(They just read the code from google and write in the videos lol).

@SimpleSnippets Год назад

Thank you bro ❤️😊 happy to know you like my teaching style 👍

@kaushalyadissanayake6559 3 года назад

Thank you thank you thank you so much ❤❤ your explanation is very clear. I have never seen such a clear merge sort vedio. I'm ur neighbor Srilankan

@SimpleSnippets 3 года назад

Glad it was helpful!

@simransinha6225 4 года назад

So far one of the best explanation as compared to videos of other channels.Keep it up👍

@SimpleSnippets 4 года назад

Thats really great to know Simran🙏 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇

@Pr3kashSingh 2 года назад

So far one of the best explanation as compared to videos of other channels.

@anshipatel9703 2 года назад

After watching both parts I'm pretty much confident about merge sort...❤✌

@majgenscjain9991 2 года назад

Excellent presentation by the speaker. Very immaculately and interestingly explained the very intrricate and complex concepts.

@kasthuriram5258 14 дней назад

fabulous... brilliant explanation.. can't erase ur way of teaching from my mind . scanned from top to bottom.. ❤

@schwaad9655 5 месяцев назад

really good video! wasn't understanding the sorting part of the algorithm at first, looking at other tutorials, but with your explanation i finally get it

@SimpleSnippets 5 месяцев назад

Glad it helped!

@nagasudheer8098 3 года назад

Amazing, Understood about Merge sort and i think you missed out time and space complexity analysis....Thank you!!!

@mansigoyal4796 3 года назад

Thank you so much sir. You made engineering quite easy for me :)

@SimpleSnippets 3 года назад

You are most welcome

@dheanimates Год назад

My man explained it like butter 💥

@emerydergro5332 Год назад

The basic idea is actually not dividing the original vector into small vectors(no need to instantiate subvectors), but update the left, middle and right values, so the "arr" in the argument list of function "merge" is always the original one, and you always need to define the "k" variable instead of just tem.push_back()

@vivekmunna 4 года назад

for me dynamic allocation did not work. but when i change below 'k' assignment and temp index, it works fine ... int k =0; for(int s=l;s

@FurqaanShariff 4 года назад

Thank you soo much I had the same propblem. It would would work for size 3. But, when I went to size 7 it would only print values for before sorting and would exit the code. Any idea why? Dynamic way was working correctly before and after sorting for array size 3?

@shishankrawat2105 3 года назад

Declare the size integer as follows int b; // Stores the size of array to be used cin>>b; Main key is here : static int size = b; With the use of static keyword the size variable can be used globally. I hope it helps 🙂.

@varadkulkarni606 2 года назад

Declare vector in merge function instead of temp array and push numbers and keep all the code same It will definitely work .arr[s]=temp[s-l] keep it same as you mentioned.

@ribhusengupta9967 2 года назад

temp[s-l] what does it means and why it is working could someone explain???

@salmanmugharbel 4 месяца назад

you are the best ever I said that and I engineering maybe you the second one I say that for him

@fezalinakandol1948 2 месяца назад

For some reason I am getting an error at my mergeSort member function the erro reads expected unqualified-I’d before ‘{‘ what could this mean

@muzammalhussain4887 Год назад

in merge() function, where declaring an array of interger temp[5], this should be int temp[l-r] correct me if i'm wrong.

@Sky-nt1hy 4 года назад

How can you do int myarr[size]; ??? I thought the array size should be constant unless u dynamic memory allocation such as int *myarr=new int(size) How does that code even work????

@abdelrhmanahmed1378 3 года назад

you right thats valid only in g++ compilers like codeblocks ,because it valid in c, but in other c++ compiler you need to dynamically allocate the array in order to put dynamic size

@TheMrMelodramatic 3 года назад

Thanks for this! It was very meticulous and thorough. 👍🏼

@SimpleSnippets 3 года назад

Glad it was helpful! Thank you so much buddy. It would mean a lot if you could please share our channel and videos with your friends too ✌

@yogeshchauhan9401 9 месяцев назад

You have hardcodes 5 in temp array but if we dont know the size of arr how will we do it ?

@MaxProgramming 4 года назад

Please make a video on designing a website with wordpress and 000 web host

@gaminghouse223 3 месяца назад

thanks for the valuable lesson :)

@amans6504 3 года назад

Hi dude, i wanna ask this question. Why most CSE students in india don't do the development part? Everyone is just busy solving these ds algo, cp etc.

@vidhiangrish1456 3 года назад

Because development doesn't land you a good job which is very sad because it's all development once you get the job. However, a developer must also know the useful algos but that is never enough for interviews :)

@amans6504 3 года назад

@@vidhiangrish1456 alright i already got the answer. I think algorithms and ds are fine, i enjoy them all but cp doesn't make sense, it feels like rat race.. Also, too much of ds algo is toxic, that'll make you eligible just for a job in MNC, this shouldn't be the goal, atleast for me, i wanna build something at the end.. job is old school thing.

@vidhiangrish1456 3 года назад

@@amans6504 Trust me that's my goal too. I've been so much into development that I've never even considered going for any coding challenges/ competitions. And now knowing that it won't land me a job has got me really worried cause if it's not a good company, the developers are exploited here in India.

@amans6504 3 года назад

@@vidhiangrish1456 try for startups, they don't care much about ds algo thing. Also, learning Will be far better at startups, only downside is you've to add value else they'll fire you

@SimpleSnippets 3 года назад

Ds algo cp has become overrated. Surely it's important to cover the fundamentals but yeah along with that it's more if not equally important to actually build some projects. In my recent tech talks interview with Sourav Johar(VMware employee) we discussed this point in detail. Y'all should watch the video 🤟

@mohammadhaseeb948 4 года назад

Showing error for numbers greater than 7 Sir i think the size of temp array should remain constant for every recursive call and not equal to (r-l)+1

@bonzo6989 4 года назад

Yess it should be var temp = new int[arr.Length];

@bonzo6989 4 года назад

I'm going to comment on myself lool. temp = new int[arr.Length] will work but you allocate extra space. @ Vivekanandan Mullainathan gave solution here. If temp = (r - l) + 1 then k has to be 0 not l. The copy temp to original array logic changes as well.

@owais_islamic_studio Год назад

such a worder ful video Thanks for this video

@aliajmal8517 2 года назад

In Merge function the size of temp array could be r+1 (int temp[r+1]). It's more efficient. Anyhow! learnt alot from this channel. Thank you sir your efforts that you are putting into.

@harshittanday4001 3 года назад

Great explanation

@SimpleSnippets 3 года назад

Glad you think so!

@venkatr2307 8 месяцев назад

I copied your code and tried running it but It didn't work

@vijaybhame6773 2 года назад

Best Explanation...........

@atulnath4858 2 года назад

Bro make video with hindi language so that all videos of your will be get help thanks for the explanation keep it up 👍

@ekramulnibir 2 года назад

why uve declared size=(r-1)+1; in line no 13?

@codeoutput7166 4 года назад

Thank you very much sir

@SimpleSnippets 4 года назад

Most welcome

@kylorojen8066 2 года назад

Hello sir quick question. I have a problem with this following codes because this lot is not showing up when I compile and start it. But it doesn't say that it has errors. MergeSort(x, 0, 4); cout

@pratikmulik0049 Год назад

After for loop write cout

@devamjoshi4180 4 года назад

How to do merge sort of an 2D array of co-ordinate points?

@JapotjapotGalit Год назад

Can i get the code to copy

@behindthescene4406 3 года назад

bro u got a net subscriber.

@SimpleSnippets 3 года назад

Welcome to Simple Snippets!

@ibrahemnjr9924 2 года назад

You are a legend 💕

@MKSundaram 3 года назад

Will Merge Sort sort 2D Matrix?

@mohamedboubakeur4554 3 месяца назад

Thankyou bro

@iyswaryabala4283 2 года назад

in output "after merge sort" it's not sorting properly.i don't the reason.anyone can pls say a solution .

@TheAsdasdasfasas 3 года назад

Why is the size inside the merge function (r-1)+1, can't you directly put r instead?

@akileshkumarb7750 3 года назад

( R - L ) + 1

@ZhenZhou700 3 года назад

For the first merge(arr[], l, m, r) function, more specifically merge(arr, 0, 0, 1), you'll notice that writing temp[r] gives you temp[1], an array with size of 1. However, this merge function requires an array of size 2 (eg. temp[2]), so this is the main reason you cannot directly write "r" as mentioned. On the other hand, writing temp[size] whereby size= r-l+1 does the job well. In addition, other than updating this dynamic size, the following changes have to be made as well. while (i

@XxDeAtHxMOnKeYxX 3 года назад

@@ZhenZhou700 I also made these changes and it fixed my Segmentation Fault error. I also changed 'int myarr[size]' to 'int *myarr = new int[size]' because you need to dynamically allocate the array in order to put a dynamic size: while (i

@abhishekbose5613 4 года назад

Sir if I am running this program with 7 or more elements the sorted array is not getting printed and a return value of 3221225477 is getting displayed! The code is running perfectly fine with 6 or less elements though! Where do you think I might have mistanken?

@SimpleSnippets 4 года назад

I think that is because we have hardcoded the size of the array as 5. you can take the size of the array from the user and then make those changes in the code and try. ✌

@abhishekbose5613 4 года назад

@@SimpleSnippets that is where the problem arises I haven't hard coded the values sir.. I had taken the input from the user and crossed a lot of times, but this issue isn't resolving! I tried googling out the return value also, looks like it isn't any random no. Can you help me with that? Moreover I was writing the code by looking at the video so and cross checked!

@SimpleSnippets 4 года назад

Do one thing, drop me a mail and I'll send you my version of code which takes size of the array at run time. Mail me at - simplesnippetsinfo@gmail.com

@abhishekbose5613 4 года назад

I've mailed you! Thank you so much!!!

@rajparmar1622 4 года назад

Yeah .. im getting segmentation fault

@jashwanthkumarvasampally2978 4 года назад

u r a god

@SimpleSnippets 4 года назад

LOL, thank you 🙏😅❤

@sahilarora7186 3 года назад

Loved it

@ElifArslan-l9g 2 года назад

thank you so much

@nomank8274 2 года назад

Can anyone please tell me how's this code even working? I mean to say that nothing is returned in main() so how's 'myarr' array is sorted given the fact that its scope is limited to main() only whereas sorting is done with the help of mergesort() and merge() which can't manipulate 'myarr' array

@abinanthanva289 Год назад

when you are passing the array to mergeSort function in main(), you are actually passing the pointer itself. An array can never be passed as an argument, hence when you pass an array to a function, it's always a pointer hence the array elements are also changed if you change it within the function

@everythingcelebrity6296 4 года назад

Dude also make a video on hashing

@SimpleSnippets 4 года назад

Yes I will ✌

@prabaljainn 4 года назад

Instead of saying "I think it works, please say that the "scope is limited". 8 : 54

@maitreyshukla258 3 года назад

wow

@prabaljainn 3 года назад

@@maitreyshukla258 shukla Ji yaha Bhi

@Monkey_D_Luffy0001 6 месяцев назад

A rrrrrrrrrrrr😂🤣...nice video btw

@Keshish4 4 года назад

gg usefull

@SimpleSnippets 4 года назад

THank you. Please do share the videos with your friends too 😇

@sharifajmir 3 года назад

I just stop video and suscribe execpt i could do any thing

@javedakbar5375 4 года назад

why it was not in the list?

@SimpleSnippets 4 года назад

What list ?

@aaranyaksantra9933 Год назад

🤩

@issanijem5248 2 года назад

cos imak

@anas_tabassum 3 года назад

Can anyone explain that where swapping is happening at sub levels 🤔

@TheMrMelodramatic 3 года назад

12:14 So within the merge() function there is a temporary array, temp, where we place the lower of arr[i] and arr[j]. There's not really any swapping going on because we are placing the values into a new array. After the sorting, we set the original array equal to the temp array at line 42 @ 18:00

@shinzo007 8 месяцев назад

Best video on the merge sorting All the queries are clear 💯💯

@dev754 2 года назад

Bhai your content is superior than over hyped channels. The way you explain is more than paid courses . You deserve more

@SimpleSnippets 2 года назад

Thank You so much bro ✌️ As Baburao said - Tu toh Dev manus nikla 🙏😂❤️

@floriskruger8098 2 года назад

Thank you so much sir!!!!! The diagram came in clutch!

@meghamalusare1203 3 года назад

You are very good teacher. I only think I will do coding but I never did. But after watching your videos I am doing well. Thank you so much

@kasthuriram5258 14 дней назад

need data structure asymptotic notation and recurrence rel in detail

@shivanshshrivastava5880 Месяц назад

Is merge sort always solved used functions is there not a way without using function

@SurajSinghMIS 4 года назад

This Video is not added in playlist.Please Add this video in "Data Structure and algorithms" playlist

@SimpleSnippets 4 года назад

Thank you very much Suraj for letting this know. I have added this video in the playlist 😇

@ahmadferozarshad1354 2 года назад

Bhai Jaan plzzz Urdu men perhaya karen🙏🙏🙏🙏

@saikrishnadouluri4433 3 года назад

thanks

@leggomaheggo 2 года назад

thank you so much from the state of texas!

@SimpleSnippets 2 года назад

Most welcome Eric. Glad you liked the video 😊✌️

@saikrishnamodhupalli9182 4 года назад

Bro iam getting segmentation fault iam compiling in terminal

@SimpleSnippets 4 года назад

Some internal issue. check the code link that I have shared in the video description ✌

@AnujKumar-pt9tk 3 года назад

While running code on leetcode ,it is showing addresssanitization: error stack overflow on address......plz anyone help me with this

@khurramsaeed1999 2 года назад

PLEASE USE DARKMODE PLEASE

@meghamalusare1203 3 года назад

I want to join your classes. If its possible plz let me know.

@preethinayak9659 2 года назад

Sir why we are using mergesort function as recursive

@aayushreejaiswal1568 2 года назад

Your explanation is so amazing 😊🥺 CAn you please make videos on competitive programming lessons

@Summer-me4pt 4 года назад

Fantastic stuff

@SimpleSnippets 4 года назад

Glad you enjoyed it

@Syard4250 Год назад

well explained, thanks!

@masumali8356 2 года назад

You are the best.....masum

@mohammad_zrar Год назад

pretty helpful thank you a lot, master ❤

@nitismita1035 2 года назад

Awesome 👌

@Hizzus 2 года назад

exellent

@shyamsundard5824 Год назад

Bro please help me.What can be done to sort the array in descending order

@abinanthanva289 Год назад

do the same algorithm and reverse it, that's a quick fix

@bruhbruh8137 3 года назад

the code is totally wrong, you try to insert 9 7 5 8 6.

@adeniyiadeniran6029 3 года назад

yeah it does not work for all input and even negative numbers

@GeorgeFlorian12 3 года назад

Inside `merge()` you can't allocate the size of the array the way you did because it will return an error: int size = (r - l) + 1; int temp[size]; …won't compile because of the following error: "expression must have a constant value of variable (declared at line #) cannot be used as a constant"

@ashishbhardwaj9693 3 года назад

for me it compiled for smaller array but it also gives segmentation fault for big array size not a good idea to use.

@ribhusengupta9967 2 года назад

Yes Me too...Better to put some large constant value...it wont take input size in c++ 17 ...Different compiler acts differently...mine and yours compiler are same

@mohdfaraz4306 2 года назад

you have to give size as argument in all the function calls and function argument. only then the merge sort can get the value of size. mergesort(myarr,0,size-1,size) like this