Розмір відео: 1280 X 720853 X 480640 X 360
Показувати елементи керування програвачем
Автоматичне відтворення
Автоповтор
Kya energy level hai.....waooo Agar aise teacher rahe to kaun padai nhi kar Sakta 😃☺️☺️👏😀
we want lectures like you...so there won't be any failures in future
Jo Jenny na kar paayi wo sir ne kar dikhaya .. waah sir very good explanation sir.... Aapko meri umar lag jaaye jis se aap jaise teacher padate rahe ✨
Koy sanka nay he .Absolute clear .Amezing explanation 🥇.
Yaar this was the best explanation! 👌👌
Thank u sir to make us understand in such a simple way ..😊
What would be the value of "q" if array is of odd size
@@abhishekbehera3662 The formula is q=(p+r)/2.
that was the best explanation ....thank you so much
Brilliant teacher
thank you very much sir for this video. It will very help full for my exam . again thank you sir .:)
Good acha samjhya UA-cam py dekh dekh k pagal hogya ab ap code b kr k dikha den
Barabar sir😁😁👍👍
very nice lecture
"Aaj ka video bada kamal ka hone wala hai" 😁 kyu ki aaj mai ye video dekh raha
Explain best way men kia but plz pycharm pr bhi kr diya krein code
sir, big fan
Thanks a lot🙌🔥
Nice explanation sir 👍
This was extremely helpful
jabar dast bro
Thank you sir 🌸
You are good lecturer..
Sir Kya ap pattern matching algorithm in artificial intelligence topic par video bana da ga
🎉🎉
Superbly explained
thank you so much sir
Thnxxxxxx a lotttttt🙏🙏🙏🙏
Thanks sir to clear my problem
Sahi Khel Gaye sir!!!
Thank you
Thanku sir
this was good one.
🙏🙏
Exam in very helpful
Thanku so much sir ......
sir agar jo 2 array list apne separate kari hai wo agar sorted naa ho toh kaise karenge ???
The fact is array starts from 0
how to find time complexity
sir what if in the left array the sequence is 31,29 instead of 29,31 fir ye output array me ham kaise likhte???
if we consider your case 31,29 then it will not be sorted array and in merge sort we are taking two partially sorted array and merge them
Your Point is correct but when we are talking about the merge sort we will always consider two partially sorted array to get this confusion out from the mind check merge tree , [+] Link - en.wikipedia.org/wiki/File:Merge_sort_algorithm_diagram.svg
how to set any index to infnity ......<??
In c++ Use INT_MAX
we wanted parallel merge sort
sir iska ek proper code likh do please sir will be highly thankful to you.
why you did not start array from index 0?
Aur n2 n1 ka formulae kasay bnaya
I am not able to find your video on the selection sort.
value of q depends on the starting of right sorted array it is not always at the middle
@@varshajawrani5153 thank you
why did not you start your index number with zero? kindly respond asap :}
Sir what if the left array and right array are not itself sorted?
nothing is going to happen.....at the end, after comparison.....in the new array say B.....the elements gets sorted one by one.
this is only the initial condition for merge function....even in merge sort where this function is used we use already sorted array step by step....
Array start with zero
What if the number of elements are 9?
Koi batar ka p q hame kasa pata chale ga ka kiya jai
sir q ko q ki trh bnao g lgra hai wo
sir mid value nikalne bataye hi nhi
j n i ki smjh nh ai kaha se ay ye
agar phly sy sort na ho to
Sir bilkul smjh nhi aa rhi algorithm
aap sab ke baap ho, idhar US aa ke sikhao please
Duvara mat smjhana aise kisi ko Simple si algo ki rail bana di
Chuti**ya ho bilkul itta accha samhaya hai
sala ee mergeshort samajh me kahe nahi aate be
🤣🤣🤣🤣
@Neha Yadav mere samjh aa gya ab 😂
@Neha Yadav tab exam they 😂
@Neha Yadav it's my youtube channel , Kindly subscribe ✨
@Neha Yadav insta !?
Kya energy level hai.....waooo Agar aise teacher rahe to kaun padai nhi kar Sakta 😃☺️☺️👏😀
we want lectures like you...so there won't be any failures in future
Jo Jenny na kar paayi wo sir ne kar dikhaya
.. waah sir very good explanation sir.... Aapko meri umar lag jaaye jis se aap jaise teacher padate rahe ✨
Koy sanka nay he .
Absolute clear .
Amezing explanation 🥇.
Yaar this was the best explanation! 👌👌
Thank u sir to make us understand in such a simple way ..😊
What would be the value of "q" if array is of odd size
@@abhishekbehera3662 The formula is q=(p+r)/2.
that was the best explanation ....thank you so much
Brilliant teacher
thank you very much sir for this video. It will very help full for my exam . again thank you sir .
:)
Good acha samjhya UA-cam py dekh dekh k pagal hogya ab ap code b kr k dikha den
Barabar sir😁😁👍👍
very nice lecture
"Aaj ka video bada kamal ka hone wala hai" 😁 kyu ki aaj mai ye video dekh raha
Explain best way men kia but plz pycharm pr bhi kr diya krein code
sir, big fan
Thanks a lot🙌🔥
Nice explanation sir 👍
This was extremely helpful
What would be the value of "q" if array is of odd size
jabar dast bro
Thank you sir 🌸
You are good lecturer..
Sir Kya ap pattern matching algorithm in artificial intelligence topic par video bana da ga
🎉🎉
Superbly explained
thank you so much sir
Thnxxxxxx a lotttttt🙏🙏🙏🙏
Thanks sir to clear my problem
Sahi Khel Gaye sir!!!
Thank you
Thanku sir
this was good one.
🙏🙏
Exam in very helpful
Thanku so much sir ......
sir agar jo 2 array list apne separate kari hai wo agar sorted naa ho toh kaise karenge ???
The fact is array starts from 0
how to find time complexity
sir what if in the left array the sequence is 31,29 instead of 29,31 fir ye output array me ham kaise likhte???
if we consider your case 31,29 then it will not be sorted array and in merge sort we are taking two partially sorted array and merge them
Your Point is correct but when we are talking about the merge sort we will always consider two partially sorted array to get this confusion out from the mind check merge tree , [+] Link - en.wikipedia.org/wiki/File:Merge_sort_algorithm_diagram.svg
how to set any index to infnity ......<
??
In c++
Use INT_MAX
we wanted parallel merge sort
sir iska ek proper code likh do please sir will be highly thankful to you.
why you did not start array from index 0?
Aur n2 n1 ka formulae kasay bnaya
I am not able to find your video on the selection sort.
What would be the value of "q" if array is of odd size
value of q depends on the starting of right sorted array it is not always at the middle
@@varshajawrani5153 thank you
why did not you start your index number with zero? kindly respond asap :}
Sir what if the left array and right array are not itself sorted?
nothing is going to happen.....at the end, after comparison.....in the new array say B.....the elements gets sorted one by one.
this is only the initial condition for merge function....even in merge sort where this function is used we use already sorted array step by step....
Array start with zero
What if the number of elements are 9?
Koi batar ka p q hame kasa pata chale ga ka kiya jai
sir q ko q ki trh bnao g lgra hai wo
sir mid value nikalne bataye hi nhi
j n i ki smjh nh ai kaha se ay ye
agar phly sy sort na ho to
Sir bilkul smjh nhi aa rhi algorithm
aap sab ke baap ho, idhar US aa ke sikhao please
Duvara mat smjhana aise kisi ko
Simple si algo ki rail bana di
Chuti**ya ho bilkul itta accha samhaya hai
sala ee mergeshort samajh me kahe nahi aate be
🤣🤣🤣🤣
@Neha Yadav mere samjh aa gya ab 😂
@Neha Yadav tab exam they 😂
@Neha Yadav it's my youtube channel , Kindly subscribe ✨
@Neha Yadav insta !?