transforming the 0 into 1 was too greedy :)

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).

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.

Hi Tim. Today is my birthday. I love your content

why isn't it 4,3,2,0 for a sum of 9? at 3:12

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 !

Why 1 instead 0

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.

Hi Tim can we expect more questions on algoexpert?

3:12 you said: we select 0 but how can you get 1 then 😕😁😢

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 )

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))

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.

Thanks for the help brother.

Expecting more ds and algo

We're greedy more algorithms in future 🔥

I would like to see contents on dynamic programming too tim

Can we expect a playlist on greedy or DP?

Tons of thanks.. I hope you will continue to more algorithms

Thank you very much!! I'll try implementing this in a c++ program.

I'm all in for an algorithm series from Tim ! I'll even pay for that!!

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.

I loved this video. Please continue this algorithms and data structures series

funny thing is 18 is also the optimal solution for non-fractional units, isn't it? A lucky example :p

NEED MORE DS AND ALGO!❤❤❤❤

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.

Great video. I have this exact problem in Skyrim.

Greedy means the solution is self-similar - it works at smaller scales (subsets) within the same input.

Awesome ty for the explanation! Any chance on going over a flow (vector) field in the future?

love how you explain

??? 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.

Love the content. Fair play to you keep it coming

yeaaaaaa boii tim made an algorithm video this gonna be amazing

Now this is more like it!! 🔥

please make a algoithm and data structures tutorial

Good video dude, how would you implemnt this algo in python, can you do a practical example

please more videos like this

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.

I would solve it with recursion just like the coins exchange problem

Algorithm: *Laughs* *in* *Mr* *Krabs*

thank you so much!

And what about the code how they look like?

The Hamster Kombat problem

Hi Tim Can You make tutorial about implemate ai to some game(like birds example) in python? It was super.

the handwriting is not so bad man. Its better than mine 😆

Brother Mico graddy solution please

tim when are you doing more podcasts? pls reply

I've never thought that a fractional knapsack problem could be much easier to solve than a original DP knapsack problem 😂

Will Dynamic Programming (DP) be explained in the video? hahaha

Wassup Fresca? How's life on Tim's keyboard?

my hash rate is 0.053mh/s why ;-; rx 470 4gb binance

Are we just suppose to ignore his cat? 0:09

not clearly able to understand

Like for the cat:3

Awesome 😎

that's a backpack of holding (for the tibia player 🤪)

Hey tim! what's up!

hey there 😃

can you put indonesian text translite plz🥺

Bruteforce

Hi Tim. Today is my bathday. I like your

KITTY.

KITTY

First

9 mins ago.

Yayyy cattt :)

😍😍😍♥♥

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.