sir to be honest I never really understood ADT's since the start in school. But by just watching your wonderful playlist I have fully understood ADT's. Thankyou soooo much. I can't thank you enough. every teacher shoud be like you. you explain wonderfully!> Thankyou
Sorry, I filmed this to be part of a series covering all ADTs and search algorithms. Sadly I didn't get the videos for linked list and binary tree filmed. I hope to complete the series soon.
If everything else goes smoothly, == will work fine. But in general when we are programming, we want to think about making our code as robust as possible. If something goes wrong elsewhere and numElements somehow goes above size, we still want these checks to catch that.
sir to be honest I never really understood ADT's since the start in school. But by just watching your wonderful playlist I have fully understood ADT's. Thankyou soooo much. I can't thank you enough. every teacher shoud be like you. you explain wonderfully!>
Thankyou
your videos are amazing, could you please upload the rest of the series?
Thanks a lot for the video!
Cheers mate good video
THANKYOUUU
sir you didnt include the link...
Sorry, I filmed this to be part of a series covering all ADTs and search algorithms. Sadly I didn't get the videos for linked list and binary tree filmed. I hope to complete the series soon.
@@rjmcompsci thankyou sir for the quick response. the exam is on 22nd May
@@rjmcompsci Please upload them over this weekend. Would really be helpful!!
why is numofelements >= SIZE and not numofelements == SIZE? the number of elements cant exceed the size of the array.
If everything else goes smoothly, == will work fine. But in general when we are programming, we want to think about making our code as robust as possible. If something goes wrong elsewhere and numElements somehow goes above size, we still want these checks to catch that.