Such crisp and to the point explanation for this topic can never be found literally coz I have searched for this and I did not understand the textbook version also. I just remembered it as O(n) but now I know WHY it is O(n).. All thanks to varun sir.. you are awesome as always..!!
@Bilalking8bpyt1
Жыл бұрын
Bhai yeh AP or GP KIA CHEEZ HY? 14:40
@kaushiksai1201
Жыл бұрын
@@Bilalking8bpyt1 arithmetic progression and geometric progression bhai
@saklain_mustak1
3 жыл бұрын
varun sir, I'm very happy today.. in our semester exam for formal language and automata theory(FLAT) .. i watch your TOC series... due to lockdown i missed the subject... and i feel this time i fail... but when i enter exam hall and writing the exam i had done because of you sir... a big thank you sir....
@ronakpatil6081
3 жыл бұрын
even if you watch this video on 1.75x speed you will understand, thats how good sir teach us hats off😊
@gangadharamdantu9614
3 жыл бұрын
Feeling blessed and glad after watching this, topic that can't be understood in 3 months of sem u made it clear in 30 minutes.thankyou so much sir🙏🏻
@sambitkumartripathy5884
3 жыл бұрын
amazing content sir!!! people used to get addict to web series, movies.. but i got addict to this playlist.... Honestly saying sir...its already 3.05AM and i am not going to stop here!! Damn your teaching skills are amazing...
@SaumyaSharma007
3 жыл бұрын
Literally wow. Best teacher in the world 🌟🌟🌟🌟🌟
@poorvahulke3245
3 жыл бұрын
Amazing Explanation Sir....PLEASE ACCEPT MY SALUTE FOR YOUR A1 TEACHING SKILLS...YOU ARE INDEED A GIFTED TEACHER!!!!
@GateSmashers
3 жыл бұрын
Thanks a ton..
@yashsahu2488
3 жыл бұрын
The way you explained the derivation was really exquisite sir...
@ambivertprabhu4160
3 жыл бұрын
Great Varun sir
@dishasuthar5508
Жыл бұрын
Yes sir right ..kahi pe bhi ye wala explaination nahi mila..Thank You so much Sir for this video.
@fahadbhattibhatti2494
8 ай бұрын
Excellent content and concept as well Really nice and to the point every thing💥
@sabanafees8034
3 жыл бұрын
I have no words to praise you 👍
@hamzakashif5651
2 жыл бұрын
You are good! I will get good job because of you!
@androidguides6862
2 жыл бұрын
Amazing explanation sir and it is very benefit for students that you are providing notes in pdf ☺️☺️
@priyanshujain8935
3 жыл бұрын
You are amazing sir. Your way of teaching is next level. Keep up the spirit sir and thank you so much for such an awesome video and explanation.
@Jaun.Elia1573
6 ай бұрын
mind blowing method of teaching sir tmmorow is my paper and mai har finals k papers ki tiyari ap ki videos daikh kr krtaa huu love from PAKISTAN sir😍
@ashishkumaryadav5252
10 ай бұрын
Sir no. Of nodes at last level are 'n' so total should be '2n' and thereby height should be log(2n) not log(n)
@zulfaqiarkhan9787
3 жыл бұрын
Amazaing Sir Mind blooing Explanation. Your way to teach and explain these problem is sooo smooth and satisfactionating. God blesss you with All wishes that you want in your life. Ameeeeeeeen
@sumitmore8405
Ай бұрын
Just loved the teaching and I got concept cleared
@divyanshushekhar1928
7 сағат бұрын
Ways to Build a Heap : Remember : In a Binary tree of 'n' elements there are n/2 elements in the last level. And the height of the tree is log(n). 1.) Putting elements one by one. In the worst case we may need to swap every element iteratively to the top (imagine a max heap where biggest elements are added at the last). So, at the last level, we will swap n/2 elements to top, each element going through log(n) swaps at each level. T(n) = n/2 * log(n) = O(n*logn) 2.) Heapify method - we do reverse of the last method. The most number of swaps i.e., log(n) is made by only one element -- the root node. Most elements (n/2) have to make no swap at all as leaf nodes do not need to be compared.
@reetikbahadur1715
3 жыл бұрын
Sir ap bahut hi badhia smjha te hen 😃😃😃concept pura smjh me ajata he 😇😇thanku sir and carry-on ☺😇😇
@psc_youtuber
3 жыл бұрын
Very good explanation sir thanks for it.
@more_than_just_sentient
2 жыл бұрын
Sabash sir ji .. Best explaination .. especially the derivation part .. Dhanyawad sir .
@mr.gamertech9
Жыл бұрын
Thanks Sir ALLAH PAK BLESS YOU AND YOUR ALL FAMILY AMEEN.
@simplsurvival
Жыл бұрын
Sir is already blessed by shri ram that's why he have more than 1 milli0n suscriber and don't need any allah(non existin) blessing JAI SHREE RAM
@nikitasinha8181
3 жыл бұрын
Thank you 🙏
@YouAreHacked69
8 ай бұрын
when you are not preparing for exams and watching this lecture to implement in your coding, you'll realize how useless education system is...
@Delhi_University_student
8 ай бұрын
😂
@mutant_X_wolverine
6 ай бұрын
Why is that ?
@utkarshsaharawat690
4 ай бұрын
lagta hai ye fail ho gaya hai
@jibankrishnapatra
3 жыл бұрын
The best explanation ever , thank you sir
@user-vv5fe6hy8e
8 ай бұрын
Today my presentation Thank you sir Very informative vedios 😊
@mpanghal9801
3 жыл бұрын
Your videos helps me a lot Thank you sir
@takwirultayasur1944
3 жыл бұрын
My Varun Sir....The best out of oll.n please dear viewers if really it helps u then whats the problem to like n subscribe.Atleast give this lil much of favour..
@infoconveyor8056
Жыл бұрын
wow, amazing explanation, god bless you.
@sahildadhich59
2 ай бұрын
very nicely explained
@sangramsahu1931
2 жыл бұрын
Thank you sir 🙏🏻
@yuvrajyadav8861
2 жыл бұрын
best videos bhaiya .... u have explained every concept in very easy way ...
@srikanth26mar
6 ай бұрын
The sum is calculated for 2n nodes here. because if leaf nodes are n, then simple calculation will tell you that there are totally 2n nodes. if S = 2n-2-logn for 2n nodes, then for n nodes, it would be S=n-1-logn/2
@user-jb3wx6wh9c
Жыл бұрын
Best teacher in the world
@kosaransari5493
2 жыл бұрын
Thanku so much sir for making this easy to understand
@sidraqueen5164
3 жыл бұрын
salam, your teaching method is very good sir
@GateSmashers
3 жыл бұрын
Thanks and welcome
@tushardalave4619
3 жыл бұрын
Best lecture 👍👍
@arshadsaleem3062
Жыл бұрын
absolutely stunning ... thanks alot from pakistan
@fahmithaea6770
2 жыл бұрын
After cracking ugc net with your help, here I am again to crack my psc hsst..
@bharti9273
3 жыл бұрын
Wonderful session.
@prasadpathak3658
2 жыл бұрын
Thank you sir for making this video🙏
@sabanafees8034
3 жыл бұрын
Your best teacher in the world 👍👍
@smd5033
2 жыл бұрын
damdar explanation sir jee
@imranwahid9871
3 жыл бұрын
Thanks a lot sir, really this explanation with such proof is not available anywhere else.
@harmeetsinghvirdi8850
7 ай бұрын
Beautifully explained
@sratnamanjari244
3 жыл бұрын
Thank You so much Sir 😊
@xzeeezploua1728
2 жыл бұрын
Thank you sir
@rafayasif1508
Жыл бұрын
Bhetreen bhaii bhtreen ♥️♥️
@b.s.gaming8347
3 жыл бұрын
Very simple and understanding in your explanation sir Thank you
@48_subhambanerjee22
2 жыл бұрын
Love you sir 🙂🙂
@Subha_FF575
3 ай бұрын
Awesome
@shovon64
2 жыл бұрын
Amazing
@flyingmachine6667
3 жыл бұрын
Amazing Sir👏👍
@muhammadjurrair5335
7 ай бұрын
Nice Sir Thanks
@ayushiyadav1
4 ай бұрын
thnx a lot sir.
@PrajwalSingh15
3 жыл бұрын
Amazing explanation sir 🤩
@peterraj8661
6 ай бұрын
Sum of GP series in that Case using heaping methods 👌
@AliHamza-qs7nu
2 жыл бұрын
Million dollar video 😍 Love from Pakistan 💕
@sameersahto
3 жыл бұрын
Love you sir
@ZSHADOW18
3 жыл бұрын
0 dislikes, awesome !
@MdShahnawaz-CS-
Жыл бұрын
fantastic teaching skills sir
@ANSHSONI-tt8xz
3 ай бұрын
It's so good
@HRDsouza
7 ай бұрын
You're the best thanks sir
@xyz-pc3tl
2 жыл бұрын
Thanks a lot for helping us and all your hard work ...... 🙏🙏🙏🙏🏾🙏🏾🙏🏾🙏🙏
@seshadridutta4128
9 ай бұрын
Well explained
@Varsha_Thomas
7 ай бұрын
Sir, why did you start from the right most node for swapping? Can't we start from the left node? 5:02
@shikujha4141
3 жыл бұрын
Sir plzz make a video on priority queue
@Subha_FF575
3 ай бұрын
you are the best
@ujjwalraj4093
Жыл бұрын
Lobh your work sir ❤
@GateSmashers
Жыл бұрын
Thank you so much 😀
@shradhadidiDelta
2 жыл бұрын
thank you sir you are the best ..... praying god for 1M subscribers
@sohamguha238
Жыл бұрын
Great Explanation❤
@sounki1
3 жыл бұрын
sir u must come on Unacademy or Gradeup eitherr u must be lived so that every one learn through the best of you !! Proud of u !!
@dhruvilsolanki9887
Жыл бұрын
great explaination
@kaushikkumarbhoi4794
2 жыл бұрын
The only classes I can learn with great interest
@jisan5046
Жыл бұрын
Thanks and love from Bangladesh.
@actionkamen4236
2 жыл бұрын
thanks for this video
@jaskaransingh0304
Жыл бұрын
Amazing explanation!
@esharahman1523
8 ай бұрын
Best teacher 💫
@sudhamoneyjayaprakash5704
3 жыл бұрын
thank you sir for telling why it is o(n)
@teacherqasim
3 жыл бұрын
very good explination
@ridewithpoulami
3 жыл бұрын
mindblowing teaching.
@ritu_raj_s
3 жыл бұрын
log(n) here n i.e 31 is total number of nodes. At height 0, n is only half of total number of nodes! i.e. n is 16
@aryangupta1971
2 жыл бұрын
Awesome content sir also love the t-shirt ❤👌
@UttkarshJainmeb
3 жыл бұрын
thanks
@faiqahmad916
3 жыл бұрын
Superb explanation sir g
@KuchBhi-bs7sc
Жыл бұрын
Best Sir
@waqasijaz4107
2 жыл бұрын
Here a night before exams thank you!!!! this is a really good explaination Love from Pakistan.
@river.
Жыл бұрын
nicely explained
@user-gs5vt4gk8p
10 ай бұрын
Great 👍
@anabiyaqueen2151
2 жыл бұрын
Assalamualaikum sir ! I m very thankful to you for this amazing video ... Superb explanation 💕.
@ijazkhanniazi800
2 жыл бұрын
👌
@rohitdhaker4986
3 жыл бұрын
Sir kindly cover Peterson solution and monitor solution of critical section problem in OS
@jayannac3238
Ай бұрын
Tq sir 😢
@08twistedfork
3 жыл бұрын
Great video man !!!! Very crisp and to the point explanation. Keep up the good work.
@taneyasoni
3 жыл бұрын
Please check my comment. Complexity comes out to be O(n) where n is the number of leaf nodes. But complexity is in terms of the total size of data structure. But here we are calculation complexity in terms of leaf node.
@girikgarg1268
2 жыл бұрын
Here n is number of leaf nodes and N is number of total nodes in the heap. We can say that n
Пікірлер: 205