I already had the answer to optimal solution but only because this is EXACTLY what you do in your head when you are comparing prices at a grocery store. Maximizing the value/size ratio to stay within a certain limit (your grocery budget).
@radicalpotato666 Жыл бұрын
The grocery budget is typically a range, so I think the greedy algorithm may be quite helpful.
@mintlatte13766 ай бұрын
well, in my head I don't have to write a code to make it work, every one walks through the logic and no one shows how on earth I should code all this(
@7369393 жыл бұрын
Tim, please more videos like this. 20-30 videos of Greedy algorithms then 20-30 videos of Dynamic programming, then Divide and Conquer - this is the real programming: Django, Flask, React everyone can learn fast, but Algorithms are more important.
@dylanwilliams98603 жыл бұрын
Do you realise how much work goes into even a single video? The research and fact checking, development, storyboarding, editing and all the steps I didnt mention mean a 20 minute video for us takes 2-4 days each to make. 20 videos is way way way overkill for just about anything you could want to learn. You would actually want like 3-5 videos on it as thats an hour and a half of lectures, is more than enough to explain a topic, and won't take him a full year to get out.
@rortox15393 жыл бұрын
@@dylanwilliams9860 This. Most people dont realize that they get literal days of work for absolutely free on KZfaq
@7369393 жыл бұрын
@@dylanwilliams9860 Yes, I realize, but anyone can spend 15-20 minutes for creating video to discuss only one competitive programming problem.
@dylanwilliams98603 жыл бұрын
@@736939 first off, competitive programming is fun. But its full of bad practices that should never be within 300 light-years of production code. Secondly, I just said the videos take days to create and check. Most Vlogs even take several hours worth of takes for big channels. The only time something takes "20 minutes" is in your head or on stream.
@joshk93282 жыл бұрын
Or maybe you could create your own youtube channel and let people upload the content that they want?
@sumukhjagirdar58603 жыл бұрын
Hi Tim. Today is my birthday. I love your content
@venkatesanjayaraman29873 жыл бұрын
Happy birthday🥳 2 u
@kiw.3 жыл бұрын
Happy birthday❤️
@TechWithTim3 жыл бұрын
Happy birthday!
@DewasSquid3 жыл бұрын
happy birthday! 🥳
@shemdogga28453 жыл бұрын
No one cares it’s your birthday
@whyisknight6taken3 жыл бұрын
why isn't it 4,3,2,0 for a sum of 9? at 3:12
@woolfool3 жыл бұрын
It also confuses me. Where does the 1 come from?
@daverobertson83993 жыл бұрын
@@shdwshdw-mu6vo If 4 = 4 and 3 = 3, then 0 does not = 1
@sukhmandersingh43063 жыл бұрын
@@shdwshdw-mu6vo no that's not true, 0 and 1 are completely different. Values other than 0 maybe treated as 1 in some cases but i have never seen 0 treated as 1. Tim most likely just made a mistake there.
@antoine_96672 жыл бұрын
it shouldn t he messed up :)
@samcarter9111 Жыл бұрын
I'm sure it was a mistake
@ofiryaffe82233 жыл бұрын
Nice video, also a good example because I actually understood on my own the greedy algorithm of the fractional knapsack problem. Keep making videos about algorithms !
@ajaswanth66073 жыл бұрын
Why 1 instead 0
@ajaswanth66073 жыл бұрын
1 is not in the array
@clashgamers40723 жыл бұрын
It's a mistake
@ashleydean93503 жыл бұрын
Hello . I am new to this topic - however with your explanation and some maths background this is easy topic to understand. Excellent explanation. Tim you are doing a superb job- keep it up.
@Raghav12053 жыл бұрын
Hi Tim can we expect more questions on algoexpert?
@khimleshgajuddhur68923 жыл бұрын
3:12 you said: we select 0 but how can you get 1 then 😕😁😢
@RobertPorterNZ3 жыл бұрын
Yeh I was thinking the same... max total would be 9?
@khimleshgajuddhur68923 жыл бұрын
@@RobertPorterNZ yes🙄
@rbrojas20402 жыл бұрын
I think it's an error, you should bring down 0, which would make the sum 9, like @Robert Porter said.
@dominator16993 жыл бұрын
You always upload a video on the topic I wanna learn haha. (btw idk if you knew this but fresca in arabic means a type of sweet snacks :D )
@korsik45593 жыл бұрын
def algorithm(items, capacity): ratio = sorted([(size, value, value / size) for size, value in items], key=lambda tup: tup[2], reverse=True) total_size = total_value = 0 for size, value, _ in ratio: new_size = total_size + size if new_size > capacity: break total_size = new_size total_value += value else: return total_value return total_value + (capacity - total_size) / size * value items = ((22, 19), (10, 9), (9, 9), (7, 6)) capacity = 25 print(algorithm(items, capacity))
@futhedude4848 Жыл бұрын
this is just explain for "Fractional Knapsach Problem" solved by "Greedy Algorithms", there are many more Problems we can use "Greedy" to resolve. but this clip is good at explaining so well done.
@raghaventrarajaramАй бұрын
Thanks for the help brother.
@ajaswanth66073 жыл бұрын
Expecting more ds and algo
@codeaperture3 жыл бұрын
We're greedy more algorithms in future 🔥
@aravindhang12643 жыл бұрын
I would like to see contents on dynamic programming too tim
@pythonenthusiast92923 жыл бұрын
Can we expect a playlist on greedy or DP?
@r125l63 жыл бұрын
Tons of thanks.. I hope you will continue to more algorithms
@yvanbrunel97342 жыл бұрын
Thank you very much!! I'll try implementing this in a c++ program.
@Cookie-mv2hg3 жыл бұрын
I'm all in for an algorithm series from Tim ! I'll even pay for that!!
@pedrorequio55153 жыл бұрын
Do a series on Metaheuristics, the video simplifies alot what I know is a very difficult subject, not all problems are small enough to solve like this in code or have simple heuristics to solve. I am interested in more videos on this kind of algorithms of optimization.
@ananthramvijayaraj45543 жыл бұрын
I loved this video. Please continue this algorithms and data structures series
@cuteflygon2 ай бұрын
funny thing is 18 is also the optimal solution for non-fractional units, isn't it? A lucky example :p
@mohitjain49433 жыл бұрын
NEED MORE DS AND ALGO!❤❤❤❤
@pv90603 жыл бұрын
Fun Fact: Texting robots on Mars use python to send images to the earth. It uses request module to communicate with the API on mars.
@evantoomey67122 жыл бұрын
Great video. I have this exact problem in Skyrim.
@heh2k2 жыл бұрын
Greedy means the solution is self-similar - it works at smaller scales (subsets) within the same input.
@Jkindelb3 жыл бұрын
Awesome ty for the explanation! Any chance on going over a flow (vector) field in the future?
@sanduchicu75453 жыл бұрын
love how you explain
@ys981103 жыл бұрын
??? If you can get fractions of item, why not just select the best value/size item for all? What's the point in just getting one of it? Really don't understand how this derives any optimal solution.
@kian1803 жыл бұрын
Love the content. Fair play to you keep it coming
@noobypro45603 жыл бұрын
yeaaaaaa boii tim made an algorithm video this gonna be amazing
@judedavis923 жыл бұрын
Now this is more like it!! 🔥
@unknownman52963 жыл бұрын
please make a algoithm and data structures tutorial
@billowen32852 жыл бұрын
Pretty big topic lol
@CodeWithJoe3 жыл бұрын
Good video dude, how would you implemnt this algo in python, can you do a practical example
@kasyapdharanikota85703 жыл бұрын
please more videos like this
@sunitmody60642 жыл бұрын
This is really useful Tim, but you might want to be slightly more careful with the numbers you say and write on the screen lol. A couple of times you misspoke or mis-wrote.
@alihusham15602 жыл бұрын
I would solve it with recursion just like the coins exchange problem
@justins77963 жыл бұрын
Algorithm: *Laughs* *in* *Mr* *Krabs*
@kietphamhoanganh56412 жыл бұрын
thank you so much!
@DaigoMatsuoka2 жыл бұрын
And what about the code how they look like?
@phivebee26 күн бұрын
The Hamster Kombat problem
@PP-tc1zp3 жыл бұрын
Hi Tim Can You make tutorial about implemate ai to some game(like birds example) in python? It was super.
@vishwakamps3 жыл бұрын
the handwriting is not so bad man. Its better than mine 😆
@fojifojigurjar24612 жыл бұрын
Brother Mico graddy solution please
@shawnbeans73893 жыл бұрын
tim when are you doing more podcasts? pls reply
@TheKiryu.3 жыл бұрын
I've never thought that a fractional knapsack problem could be much easier to solve than a original DP knapsack problem 😂
@HuanYinKoh19953 жыл бұрын
Will Dynamic Programming (DP) be explained in the video? hahaha
@harshit.chitkara3 жыл бұрын
Wassup Fresca? How's life on Tim's keyboard?
@thenewelegance77723 жыл бұрын
my hash rate is 0.053mh/s why ;-; rx 470 4gb binance
@Ben-jw7yw3 жыл бұрын
Are we just suppose to ignore his cat? 0:09
@raghunathmahakud37253 жыл бұрын
not clearly able to understand
@criss54043 жыл бұрын
Like for the cat:3
@demonslayer85023 жыл бұрын
Awesome 😎
@flyte98442 жыл бұрын
that's a backpack of holding (for the tibia player 🤪)
@mrolivernone40403 жыл бұрын
Hey tim! what's up!
@Knuddelfell3 жыл бұрын
hey there 😃
@lonelyboy86403 жыл бұрын
can you put indonesian text translite plz🥺
@scrutinyng30183 жыл бұрын
Bruteforce
@GenericInternetter3 жыл бұрын
Hi Tim. Today is my bathday. I like your
@pshr24473 жыл бұрын
KITTY.
@skyricq3 жыл бұрын
KITTY
@dydigaming3 жыл бұрын
First
@mastersrikavipriyan2803 жыл бұрын
9 mins ago.
@nickchourchoulis3 жыл бұрын
Yayyy cattt :)
@AMIN-yn5nl3 жыл бұрын
😍😍😍♥♥
@emonymph69113 жыл бұрын
Tim, with all due respect. Pretty please invest in a digital inkpad your handwriting is worse then a busy doctors... Writing with the mouse is hard but I think you will be fine with a e-pad.