Hey Sundeep! Excellent video; explanation is very clear and easy to follow. I just have one piece of feedback: I was wondering if you could edit the closed captions for this video? I have noticed some instances where the auto-generated captions display the wrong words (for example, around the 9.5-minute mark, Sodom instead of sort them, and entity instead of and 30) and this might make it more difficult for the folks globally who rely on closed captions to understand the videos. Thank you very much and have a great day!
Sir, I request you to explain this with program the way you explain program with examples is very nice, please explain it with program as early as possible. Thanks for your awesome videos.
// Merges two subarrays of arr[]. // First subarray is arr[l..m] // Second subarray is arr[m+1..r] void merge(int arr[], int l, int m, int r) { int i, j, k; int n1 = m - l + 1; int n2 = r - m;
/* create temp arrays */ int L[n1], R[n2];
/* Copy data to temp arrays L[] and R[] */ for (i = 0; i < n1; i++) L[i] = arr[l + i]; for (j = 0; j < n2; j++) R[j] = arr[m + 1+ j];
/* Merge the temp arrays back into arr[l..r]*/ i = 0; // Initial index of first subarray j = 0; // Initial index of second subarray k = l; // Initial index of merged subarray while (i < n1 && j < n2) { if (L[i]
for (4:54), why did the mid become ((0+1)/2) when as you have said, it should be the floor value of (low + high) divided by two --> low = 0, high = 2, therefore, floor((0+2)/2)?
hi middle value is used to divide the elements into two parts and this will be implemented using Divide and Conquer method. Hope your doubt has been clarified and if not let me know.
Sir please give the program to merge sort
If you are making the mistakes it means not copying the solution true teacher❤️
Hey Sundeep! Excellent video; explanation is very clear and easy to follow. I just have one piece of feedback: I was wondering if you could edit the closed captions for this video? I have noticed some instances where the auto-generated captions display the wrong words (for example, around the 9.5-minute mark, Sodom instead of sort them, and entity instead of and 30) and this might make it more difficult for the folks globally who rely on closed captions to understand the videos. Thank you very much and have a great day!
We understood the concept we would be great ful if you explain with the program also
Sir,Please explain merge sort with program.
same sir
Sir Naku next week nundi semester start avtundi mi videos challa baga ardam avtunay Thank you sir
Thanks Sundeep sir ! Really helpful 👍🏻😸
Nice explanation it helps me alot tq sir
Sir ur explanation is too good sir....but we are wishing you to explain the example with a programm...then we'll feel it much more easier...
sir... please prepare video on quick sort.. its a request sir.. 🙏
Sir, I request you to explain this with program the way you explain program with examples is very nice, please explain it with program as early as possible.
Thanks for your awesome videos.
Excellent explanation
where is coding part?
Good details about merge sort technique
Tq sir
Sir ....Make a video about Quick sort
sir,ur videos are excellent and very clear.can u please explain this merge sort with code please ...
Nice explanation sir
sir It would be great is u add program and explain it ..as u did in previous sorting videos..
sir please explain programs n algorithms for all sorting techniques
Good explanation
Good morning sir I have one request sir please upload the explanation of quick sort algorithm sir...tq
sir i have watched almost your all videos all are good but please explain with for loop as you have explained in bubble sort
Now where is the algorithms? We could understand how to break the given array, but how to write it as a code? That's what I was looking for.
Thank you very much sir..
Nice explanation
Similar to binary search technique
Will you also explain us quick sort program with example program
thanks na,baaga cheppinav.Oka program kuda cheppunte perfect undedi.
4 52: it's not 0+1/2.
It is 0+2/2
Yes
He apologized for his mistake
Sir meru super
Please explain with both algorithm and example...
Thank sir for this explanation
Thnkuu sir 🙏
please take a wider whiteboard so you can explain clearly.
Sir please make a video on merge sort programming in C
Helpful
sir...explain the coding part
Yes sir
Sir ... explain coding part also please
What is the use for finding mid
Sir plzz explain the programs ( merge n radix sort
wow
explain with program, trace the program explaination required
we got the graphical representation but not the program
Execution part for this technique...???
explain programe step by step
Upload video on Merge sort program sir
Sir, please provide a program for merge sort in the comment section
Could you please explain merge sort with program and how it works
Please give c coding to this sort sir
Sir plz explain with coding 😥😥😥😥😥
sir,u may write the code also .
Sir apne full program nhi btaya h plz ap pura program btaiye
Sir pls explain the merg sort program ,circular queue progm ,and infix to postfix progm pls
Please explain the merge sort algorithm sir
Sir I want with example programme....
Tommorow my exam
can i get a c program for this
thanks sir
Sir plz explain with program
Sir plss I want merge sort program with explanation sir
Program step by step?
Without coding programming everybody can't understand this example so please I ill resquest exaplain programming
/* C program for Merge Sort */
#include
#include
// Merges two subarrays of arr[].
// First subarray is arr[l..m]
// Second subarray is arr[m+1..r]
void merge(int arr[], int l, int m, int r)
{
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
/* create temp arrays */
int L[n1], R[n2];
/* Copy data to temp arrays L[] and R[] */
for (i = 0; i < n1; i++)
L[i] = arr[l + i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1+ j];
/* Merge the temp arrays back into arr[l..r]*/
i = 0; // Initial index of first subarray
j = 0; // Initial index of second subarray
k = l; // Initial index of merged subarray
while (i < n1 && j < n2)
{
if (L[i]
nice code from "GEEKS FROM GEEKS" lol
🤣🤣
Sir Please explain in another method merge sort as takeing has 1st element as key or piovt
plz explain by tracing program
Explain with the program
Sir please tell with program sir
Sir explain the merge sort program
Write a programme on merge sort with detailed explanation and iteration
Program explanation kuda chaputara
please explain for loop
for (4:54), why did the mid become ((0+1)/2) when as you have said, it should be the floor value of (low + high) divided by two
--> low = 0, high = 2, therefore, floor((0+2)/2)?
yes.but ,sir apologized for the mistake. 5:30
He alreday corrected it.
explain with program ,sir
Sir please do a vedio on merge sort program explanation
Plz explain C program for Merge sort...
Sir how to write algorithm??
Please give program with explanation
Sir we want a merg sort program
Please upload merge sort and heap sort program video
sir explain with program
sir please explain bcd addition sunbtractin multiplcation and divide
Example program
sir merge sort program plls explain
I want a program of merge sort
Pls also give code of merge sort
Please explain k- way merge
What is use of mid value
hi
middle value is used to divide the elements into two parts and this will be implemented using Divide and Conquer method.
Hope your doubt has been clarified and if not let me know.
can you please explain it with code
Sir please explain merge sort program using java
Anna nuvv maavodive
Program of merge sort sir
Sir where is program for merge sorting
I need the program for merge sort sir
Program nhi hai isi liye video chhota tha
yen mayum chesavu?
Sir please give me program and explain the merge sort and then explain program
program
i want code explanation of merge sort
i want code
code plox
Where's the code