Mrs. Don Draper Hiya Don Draper (hows things after Madmen finished? :-) - thanks loads for the comment!!! A favour to ask....Any chance you could spare 30 secs to vote for HegartyMaths in this Richard Branson competition which ends in a few days. Would mean a lot to me and HegartyMaths. www.virginmediabusiness.co.uk/pitch-to-rich/start-up/hegartymaths/ Thanks Mr H
My maths teacher is your fan and tells all of his students to watch your great videos when stuck at home. He also shows your videos in our class...sometimes..while he keeps chillin on his rolling chair...lol..I still like him very much and he likes your videos alot. Thank you for putting these for free. Its a great way to educate students who struggle because of clg or money problems. Wish more students would see this and appreciate it. Be a shame to miss the opportunity to educate themselves.
Ow you took 19min to explain much better than my professor who tried to explain this lecture in two session .I have my exam tomorrow and it helped a Looot ! thank you very much!
All these lectures r vry helpfull.. Especially whn u r studying this book without any help frm a teacher.. Watchng ur lectures helped me n still is.. So thnk u.. :)
The full bin method is not an algorithm. It is a heuristic method and therefore can't be computerised. This is why the other methods are needed. Nice low-tech work though and all the better for it.
Tahirah Aukloo Hiya Tahirah - thanks loads!!! A favour to ask....Any chance you could spare 30 secs to vote for HegartyMaths in this Richard Branson competition which ends in a few days. Would mean a lot to me and HegartyMaths. www.virginmediabusiness.co.uk/pitch-to-rich/start-up/hegartymaths/ Thanks Mr H
This guy is very in depth and quite clear but there's so much little stuff that wastes time, like rewriting the ascending order to descending order instead of just going from the right or adding the wastage instead of just subtracting the optimal (if theres no wastage in the optimal which there weren't in these examples) you could subract the optimal from the actual pipes then multiply the result by the value of one (eg 12 for the pipes
im still wondering how you divide the data when doing full bin packing algorithm. I mean, if I were you, I will try to fulfill the size of 12, by doing decreasing number, after 7 then I'll see 4 first, instead of 3.. I mean, these number are still small number. If I have a lot of data, then it will be difficult to form such a combination.. so what is the best way to find the combination that fulfill the size?
for the quick sort algorithm, say if the pivot was 6, and the number 6 was also in the list elsewhere, would you put it before or after the pivot of 6? would it even matter? it would be really helpful if someone could tell me soon as my exam is in less than 2 days :o thankyou x
Hello Sir, thank you for the very useful video. :) I have a question. I calculated the lower bound and it came out as 4.03. Is the lower bound gonna be 4 or 5?
It is 12:58 am now, and I have my exam in 9 hrs. This is still the best video even after 12 years. Thanks a ton!
You explained in 20 minutes what my professor could not explain at all. Bless you!
Mrs. Don Draper Hiya Don Draper (hows things after Madmen finished? :-) - thanks loads for the comment!!! A favour to ask....Any chance you could spare 30 secs to vote for HegartyMaths in this Richard Branson competition which ends in a few days. Would mean a lot to me and HegartyMaths. www.virginmediabusiness.co.uk/pitch-to-rich/start-up/hegartymaths/ Thanks Mr H
My maths teacher is your fan and tells all of his students to watch your great videos when stuck at home. He also shows your videos in our class...sometimes..while he keeps chillin on his rolling chair...lol..I still like him very much and he likes your videos alot. Thank you for putting these for free. Its a great way to educate students who struggle because of clg or money problems. Wish more students would see this and appreciate it. Be a shame to miss the opportunity to educate themselves.
You're an absolute legend, this vid helped me understand D1 better than what my teachers explained
Ow you took 19min to explain much better than my professor who tried to explain this lecture in two session .I have my exam tomorrow and it helped a Looot ! thank you very much!
All these lectures r vry helpfull.. Especially whn u r studying this book without any help frm a teacher.. Watchng ur lectures helped me n still is.. So thnk u.. :)
Put it after. The algorithm says write all numbers less than 6 down before it. 6 is not less than 6 (it equals 6) so write this after
Thats a nice and quick explanation. I was wondering how to deal with the same problem but in 3D space.
The full bin method is not an algorithm. It is a heuristic method and therefore can't be computerised. This is why the other methods are needed. Nice low-tech work though and all the better for it.
Did I mention that I am a big fan of yours?:)
Thank you!!:)
Tahirah Aukloo Hiya Tahirah - thanks loads!!! A favour to ask....Any chance you could spare 30 secs to vote for HegartyMaths in this Richard Branson competition which ends in a few days. Would mean a lot to me and HegartyMaths. www.virginmediabusiness.co.uk/pitch-to-rich/start-up/hegartymaths/ Thanks Mr H
You rock buddy! Such a life saver!
great explanation great video
awsome explanation sir thank you wish could hv got a lecturer like you
Thank god for @HEGARTYMATHS !!
Excellent!!
This guy is very in depth and quite clear but there's so much little stuff that wastes time, like rewriting the ascending order to descending order instead of just going from the right or adding the wastage instead of just subtracting the optimal (if theres no wastage in the optimal which there weren't in these examples) you could subract the optimal from the actual pipes then multiply the result by the value of one (eg 12 for the pipes
thank you for the video. Is this algorithm like the Knapsack algorithm?
wow, thats lot of understannding in one video, thankx...:)
Thank you so much Sir
Thanks a lot!
Explained extremely well!
im still wondering how you divide the data when doing full bin packing algorithm. I mean, if I were you, I will try to fulfill the size of 12, by doing decreasing number, after 7 then I'll see 4 first, instead of 3.. I mean, these number are still small number. If I have a lot of data, then it will be difficult to form such a combination.. so what is the best way to find the combination that fulfill the size?
Isn't the full bin packing algorithm always going to be the best? What's the point of using the other 2
In a really massive list full bin packing is difficult to use.
Thanks for this video
for the quick sort algorithm, say if the pivot was 6, and the number 6 was also in the list elsewhere, would you put it before or after the pivot of 6? would it even matter? it would be really helpful if someone could tell me soon as my exam is in less than 2 days :o thankyou x
9:02 Not 48, 12+12+6+14+9 = 53
How do you calculate the lower bound if the bins vary in size?
Is the full bin packing method an algorithm or ad hoc? Thanks for the videos!
for the full bin algorithm is it okay to use triples instead of pairs?
why isn't the binary search past paper questions not working?
Is there any algorithm can be applied for the third method (Full bin packing) which is used for computing automatically?
no
perfect
What about ONLINE BIN PACKING.
Do you have a Video with real examples?
Love how everyone watching is probably resitting
Hello Sir, thank you for the very useful video. :) I have a question. I calculated the lower bound and it came out as 4.03. Is the lower bound gonna be 4 or 5?
+john alfred 5, because in actuality you can't get 4.03 bins, so you'd need 5 :)
-Hi there.
-General Cenoby.
hahaha I like how someone called "Jack Binns" is commenting on a video about bin packing...
on9:05 mistake：2*2=4
LAVVV ITTTTT
I thought it was DP algm....
and another one
i am! :)
how the fuck can i reply with this new layout
duel me fiend.
❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤
literally nobody cares