You have not explained properly when it comes to pass=2, you did not explain how swapping took place to ultimately get the sorted values in pass = 2.. I wil not be able to code with your current explanation
EVERYONE WHO IS Still CONFUSED HERE IT IS IN A NUTSHELL: For the first pass (when n/2 =5), the first element is compared to the element ahead by five subscripts. This is done five times(So, for the second time for example, element 1 is used, and compared with the element 5 subscripts ahead of that, and so on).then after the swaps If they are necessary, it will start out at the zero index again for pass 2(5/2 is 2.5 of course there isn’t 2.5 gap of subscript just int part). The zero index and the index two subs ahead of that gets evaluated 8 times. Cause the amount of rounds in the pass in the for loop is determined by pass < total elements (10). Then the swaps are made here. Then the last pass is 2/2 = 1. 1 0; gap /= 2), forlooptwo(i = gap; i < n; i++), for loop three (j = i - gap; j > 0 && (s[j] > s[j+gap]) if so.... { do bubble sort shit but not with adjacent elements)
Thank you sooo much dear, you are such a good learner, keep it up and create new video for all shorting, u solve my confusion about this short, thank you so much again
If you know insertion sorting then it will be easy to understand. Here at pass2, we are doing insertion sort with alternate elements i.e. gap = 2. I think you got it.
EVERYONE WHO IS Still CONFUSED HERE IT IS IN A NUTSHELL: For the first pass (when n/2 =5), the first element is compared to the element ahead by five subscripts. This is done five times.then after the swaps If they are necessary, it will start out at the zero index again for pass 2(5/2 is 2.5 of course there isn’t 2.5 gap of subscript just int part). The zero index and the index two subs ahead of that gets evaluated 8 times. Cause the amount of rounds in the pass is determined by pass < total elements (10). Then the swaps are made here. Then the last pass is 2/2 = 1. 1
Just know what is floor and what is ceil If n is 7 then it becomes 3.5 right if you use floor then value is 3 if you use ceil then value is 4 that's it
You have not explained properly when it comes to pass=2, you did not explain how swapping took place to ultimately get the sorted values in pass = 2.. I wil not be able to code with your current explanation
insertion sort is used bro
Why the fuck we are using this shell sort, when we ultimately have to perform insertion sort at gap 1 that is original insertion sort
EVERYONE WHO IS Still CONFUSED HERE IT IS IN A NUTSHELL:
For the first pass (when n/2 =5), the first element is compared to the element ahead by five subscripts. This is done five times(So, for the second time for example, element 1 is used, and compared with the element 5 subscripts ahead of that, and so on).then after the swaps If they are necessary, it will start out at the zero index again for pass 2(5/2 is 2.5 of course there isn’t 2.5 gap of subscript just int part). The zero index and the index two subs ahead of that gets evaluated 8 times. Cause the amount of rounds in the pass in the for loop is determined by pass < total elements (10). Then the swaps are made here. Then the last pass is 2/2 = 1. 1 0; gap /= 2), forlooptwo(i = gap; i < n; i++), for loop three (j = i - gap; j > 0 && (s[j] > s[j+gap]) if so.... { do bubble sort shit but not with adjacent elements)
guh dam.... what?
Thank u so much ma'am really Thanks.. Samjh nai aaa raha thaa kisi ka b apka channel open kia clearify ho gaya 100%...
Thanks mam i have understand very easily when compared to other channels
Thank you. You made it very simple. I got it.
Why did you use "selection sort" in pass 2?
Anyway explanation is good 👍
Bahut Sochne ke baad ab lagta h Subscribe karna hi padega... Badi kaam ki chiz h aapke sabhi lecture 👌👌Kar diya Subscribe maine
very good and energetic explanation until the end of the viedo. thank you
❣
Nice way to make someone understand...thanks a lot for the vedio
Thank you so much.. I finally understand this hole concept thank you so much... Go bless u👍👍👏👏👏👏🙏🙏🙏🙏💟
hole concept 💀
@@_aka5h also go bless you💀
I think pass 2 is incorrect
Thank you so much Mam
U taught really well
I don't understand : for phase-2 red coloured(2nd iteration), why you compare all the elements at once unlike previous iteration(green)??
Thank you so much Mam.
Thanks Ma'am
Welcome my child
@@ytg6663 😌
Thank you so much. You made it simple. Got it.
Pass 2 y we are comparing all values
Very well explained thanks
Why Pass 1 pass 2 distinct very confusing😢 9:15
Cleared my doubt easily..thanks
Thank you mam.....
You explained beautifully....
Thanks for your help...
Thank you for this Worth class.. Keep going
Jazak Allah Madam G.
Idk Why But i really enjoyed her saying „ok“ it was kinda cute haha
Wonderful explanation
Thank you good explanantion
the above algorithm is completely wrong
it doesn't work for the array = {21,7,15,94,36,58,23,7,11}
just do again the last passage with gap = 1
Seriously amazing explanation!
If the number of elements is odd ...means gap is 7 or 9
ultimate, nantri akka....
thankyou mam saved my sem
Thank youuu!
5:19 mam after checking if one element remains in the list without pair what we want to do?🤔 Pls answer me mam...
Mam you are so creative😍🙂
Thank u
Thanku
Mam your explaining method is very easy to absorb it thank u mam,
thank you miss
Great explanation mam... Keep it up..
understood
Thanks sister
very well explained!!
N=7/2 how to write the array
thanks priya ...
Thanku Ma'am
mam you can make a video on shell sort code in c/c++
Super explanation thank you plz mention the best case sorting the list...
Don't we need to swap in pass 2 ?
great explanation! Helps a lot!
You can also provides the notes which you write while explaining, in the description.
Very well explained ma'am thank you ♥️
Thank you mam...... Explanation is very good
Thank you sooo much dear, you are such a good learner, keep it up and create new video for all shorting, u solve my confusion about this short, thank you so much again
Short oh yea.... Haha, learn English before learning how to code
replace 70 with 78 solve .The final answer will not be in a sorted order .
How would we solve for gap 3
what is floor in gap formula
Tq mam
This is final ans is case 3 ?
In pass 2 you arranged from least to large why you have done that in pass 1 u said to change only the n elements with normal element
Super mam explain heap Sorting please
Nice 👍👍👍 well explained
pro tip- watch in 2x speed
Why
😂😂😂🤣🤣🤣
Mam plz explain radix sort
Nice video mam
Pass2 need to explain more properly
exactly i didn''t understaand it
Yeah! with atleast one more example.
@@chamuchamu2550 it is easy dear
If you know insertion sorting then it will be easy to understand.
Here at pass2, we are doing insertion sort with alternate elements i.e. gap = 2.
I think you got it.
@@saqibbhat4328 nhi degi
Thank u so much it was so helpful 😄
in pass 2 you seems to be confused
So
thanku mam
nice explaination4
pass 2 doesnt make sense..its different from whats done in pass 1 and 3..similar to selection sort
what if the N=11 then floor(11/2)=5.5 and should we take gap as 5 or 6 ?
Floor means to take least value ceil for max value
In pass 2 from where 80 comes
I understood well
Thx sister
pass 2 is confusing.....
are used to *sort the data.
It is wrong process.
You took a big short cut in middle of the video, but good video after all
EVERYONE WHO IS Still CONFUSED HERE IT IS IN A NUTSHELL:
For the first pass (when n/2 =5), the first element is compared to the element ahead by five subscripts. This is done five times.then after the swaps If they are necessary, it will start out at the zero index again for pass 2(5/2 is 2.5 of course there isn’t 2.5 gap of subscript just int part). The zero index and the index two subs ahead of that gets evaluated 8 times. Cause the amount of rounds in the pass is determined by pass < total elements (10). Then the swaps are made here. Then the last pass is 2/2 = 1. 1
pass 2 is wrong
👌👌
Maam aap ne algo nahi btai
wish you were my teacher!
i'm sorry but how if the N is odd?
thats why she says gap = FLOOR(n/2)..
Waste of time seriously
Welcome back 😁
mam are u phd? or Mphil
Nic
Radix sort and shell sort is same or different mam
different
It is wrong...
What if N is a odd number....???..
Anyone..🤔
Just know what is floor and what is ceil
If n is 7 then it becomes 3.5 right if you use floor then value is 3 if you use ceil then value is 4 that's it
if you would be near me .. i would gift you a chocolate.. thankss... very nice explaination
1 2 3 4 5 sayy with me
no clarity in explaination.
For latest lyrics goto www.baebom.com
226k views for what ? Above algorithm is wrong. Viewers please watch other videos. She is misleading
its wrong u should remove this video
same old classroom teaching. Face palm.
i think pass 2 is incorrect
Tq mam
Pass 2 is wrong
thanku mam