ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
Hi all, If you have any doubt or query, feel free to write a comment ✍️ to clarify it.
how did you know the time complexity of the average case?
Really good video. Thank you! I could shorten 45 minutes of lecture.
Very very amazing 👏explanation...
GREAT! IT WAS REALLY HELPFULL FOR ME. THAKS ALOTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT
Nice video, thanks.
very nice explanation and make a difficult concept simple to Understand thanks I subscribed to you and I hope you will upload nice content thanks
Really useful, thanks
Upload time complexity analysis for all sorting techniques
Thanks
Tq very easy explanation
Good explanation 👍👍👍
thank you maam love it
really help thank you !
Please upload more videos on loops and recursion time complexity, you are rock.
I didn't get the part where u used n/2 for the worst case could you explain it please
nice
Complexity depends on only comparisions...why not movements??
why do not you count swaps?
th-cam.com/video/peLS-S23TvE/w-d-xo.html
In the worst case: how does this N(N-1)/2 come from? I mean how do 1+ 2+ 3+ 4 become N in the next line? and why do we need to divide by it 2?
@Farzana Islam Tarin. N(N+1)/2 is Formula for sum of first n natural number. But here 1+2+3+4 is sum of first N-1 elements. So substitute N-1 in that formula to get N(N-1)/2.
👍😍
Watching this because tomorrow I have my presentation 🤧🙃
Hi all,
If you have any doubt or query, feel free to write a comment ✍️ to clarify it.
how did you know the time complexity of the average case?
Really good video. Thank you! I could shorten 45 minutes of lecture.
Very very amazing 👏explanation...
GREAT! IT WAS REALLY HELPFULL FOR ME. THAKS ALOTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT
Nice video, thanks.
very nice explanation and make a difficult concept simple to Understand thanks I subscribed to you and I hope you will upload nice content thanks
Really useful, thanks
Upload time complexity analysis for all sorting techniques
Thanks
Tq very easy explanation
Good explanation 👍👍👍
thank you maam love it
really help thank you !
Please upload more videos on loops and recursion time complexity, you are rock.
I didn't get the part where u used n/2 for the worst case could you explain it please
nice
Complexity depends on only comparisions...why not movements??
why do not you count swaps?
th-cam.com/video/peLS-S23TvE/w-d-xo.html
In the worst case: how does this N(N-1)/2 come from? I mean how do 1+ 2+ 3+ 4 become N in the next line? and why do we need to divide by it 2?
@Farzana Islam Tarin. N(N+1)/2 is Formula for sum of first n natural number. But here 1+2+3+4 is sum of first N-1 elements. So substitute N-1 in that formula to get N(N-1)/2.
👍😍
Watching this because tomorrow I have my presentation 🤧🙃