Most of the TH-camr upload the video sorting like bubbles selection insertion but when times comes in merged and heap they will not upload the video bcz they also not clarity about these two approaches merged and heap but in ur case sir speechless they way u explained no words ur teaching styles mind-blowing one day definitely more famous Gurudeva 🙏
I am glad you understood it well. If you like our efforts, will you like to write a few words about us here (www.quora.com/How-do-I-start-learning-or-strengthen-my-knowledge-of-data-structures-and-algorithms )
Thankyou beta! I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem. If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
Working CODE for me - without using 2 LHS, RHS array - using only one single temp array import java.util.Arrays; public class MergeSort { public static void main(String[] args) { int[] arr = { 8, 3, -2, 7, 5 }; mergeSort(arr, 0, 4); System.out.println(Arrays.toString(arr)); } public static void mergeSort(int[] arr, int start, int end) {
if (start < end) { int mid = (start + end) / 2; mergeSort(arr, start, mid); mergeSort(arr, mid + 1, end); merge(arr, start, mid, end); } } public static void merge(int[] arr, int start, int mid, int end) { int i = start; int j = mid + 1; int k = start; int[] ans = new int[arr.length]; while (i
Thankyou beta! If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
bcoz consider a situation where only 2 elements are there, so lo=0 and hi=1 and mid becomes 0+1/2=0 and when you do mid-1 it becomes -1 so you are saying that first function argument will be lo to mid-1 which means 0 to -1 , this doesn't make sense
Most of the TH-camr upload the video sorting like bubbles selection insertion but when times comes in merged and heap they will not upload the video bcz they also not clarity about these two approaches merged and heap but in ur case sir speechless they way u explained no words ur teaching styles mind-blowing one day definitely more famous Gurudeva 🙏
Sir you have taught recursion very well so well that now i find merge sort much easier to understand thanks sir
I am glad you understood it well. If you like our efforts, will you like to write a few words about us here (www.quora.com/How-do-I-start-learning-or-strengthen-my-knowledge-of-data-structures-and-algorithms )
@@Pepcoding sure sir
same here
This is the simplest explanation for merge sort ..... Thank you, sir !! 🙏 🙏
Happy to help
Lots of respect for you.
malik sahb koi ni h esa samjane wala love u brother
first time understand many thing:) learning is never ending process . your video inspired me a lot to study more
Sumit bhaiya Ekdum jeher padhate ho!!!!
sir bahut jagah se merge sort padhe but finally ab jakr clear hua
Thankyou beta!
I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem.
If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
Sir you clear all concept very beautifully . I like your videos and i love coding
If you like my efforts, I request a review
g.page/Pepcoding/review?rc
When u say "ye video dek k aao" please put it in annotation or link it. Also ty for your work!
Hanji beta, will provide the link.
Keep learning and keep loving Pepcoding😊
Working CODE for me - without using 2 LHS, RHS array - using only one single temp array
import java.util.Arrays;
public class MergeSort {
public static void main(String[] args) {
int[] arr = { 8, 3, -2, 7, 5 };
mergeSort(arr, 0, 4);
System.out.println(Arrays.toString(arr));
}
public static void mergeSort(int[] arr, int start, int end) {
if (start < end) {
int mid = (start + end) / 2;
mergeSort(arr, start, mid);
mergeSort(arr, mid + 1, end);
merge(arr, start, mid, end);
}
}
public static void merge(int[] arr, int start, int mid, int end) {
int i = start;
int j = mid + 1;
int k = start;
int[] ans = new int[arr.length];
while (i
if(lo == hi)
{
return arr;
} why cant I do this in base case?
sir i can not understand how you made base case
kafi ache se samkja diya apne
thank you
Great Sirr ji
Thankyou beta!
If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
base case samajh ni aaya. can anyone please explain?
I'm also having problem. Is your concept clear by now?
Sir ya euler vla video kha h
Sir ye Euler graph kyu bolte hain isko? Where is the theory on it
sir aap har cheez ko itna easy kaise bna dete ho
Mehnat se Beta
Thank you sir
So nice of you!! share among you peers
sure sir
Why did we considered two halfs of array as fsh = (lo to mid) ssh = (mid+1 to hi) why not fsh = (lo to mid-1) ssh = (mid to hi)
bcoz consider a situation where only 2 elements are there, so lo=0 and hi=1 and mid becomes 0+1/2=0 and when you do mid-1 it becomes -1 so you are saying that first function argument will be lo to mid-1 which means 0 to -1 , this doesn't make sense
Fsh and ssh ka size to dikhya hi nhi hai sir
Open eyes
Size to nhi chahiye wha bas initialise kiya