CS50 Runoff Solution - Week 3 Lab - Runoff Solution 2024. (Beginners Guide)

preview_player
Показать описание
Welcome to This is CS50 Week 3 Lab - Runoff. This tutorial will cover how to complete CS50x Runoff
Рекомендации по теме
Комментарии
Автор

I was struggling to start this problem and just found videos of people just coding without explanations. I've watched the first part of your video to understand and paused to tried myself and I was able to do it all! Just watched the full video to check if I was doing good. Thanks for the detailed explanation! <3

akarols
Автор

I love the way he explains every line! Thank you from the bottom of my heart !

MordecaiRelaxandZen
Автор

Nice. Took me 6 hours... Still have a long journey ahead. Can't wait to transition to Python.

hasakicioguz
Автор

Thank you so much, Devin! Your explanation brought so much clarity. Was about to give up since I had no idea how to start solving this problem set!

mr.prince
Автор

great job at explaining everything and making things clear to understand. thank you.

johnnyfaris
Автор

this problem was definitely the one I struggled with the most
tysm :)

drowse
Автор

You are an angel, dude! Thanks for helping my progress <3 You're awesome!

porcelain_madame
Автор

On the function is_tie you can just iterate by the candidates and check if anyone has a votes field different than min, if that's true return false, else return true.
Your way of doing it is also great but I think it's a little more complex, anyway thank's for the video and this type of content it's really great especially when you are stuck on little things.
Keep up the good job!

tiagoleite
Автор

the notes are honestly so helpful thank you

skilllessbacon
Автор

Thanks dude. You are awesome. I resumed cs50 after this tutorial. Love from Bangladesh.

taasinbinhossainalvi
Автор

Your explanations really helped to understand the problem, great video :)

estevves
Автор

thank you so much for this! your explanations were so helpful!

plushybones
Автор

If I don't use break in 12:04 won't it just go to the next rank and add to their vote? Why do I have to break there?

shanzadanwar
Автор

Hey, I know you might not be responding to these anymore but I don't get how you could say the following: == false". I don't get the candidates[preferences[i][j]] part. What does it even mean. How is a two dimensional array a point in a one dimensional array. Are you maybe just looking at the second element of the two dimensional one and using that as the index of the outer array? I watched the Tideman solution and it look to be chock-full of these expressions. I understand everything else, I am clear on structs and everything else. This is the one thing that hung me up and I had to look up a solution.

MrSomethingdark
Автор

interesting way to check for a tie, great vid

victorsenaxD
Автор

Hey Devin, I've always had this question from the day I started taking the course --I faced a lot of difficulty in the beginning and used to sit for hours to solve a problem set, whenever I can't solve that problem or need more hints to solve that problem ( after trying for 2 days) --I try to find out resources like yours in YouTube, am I doing it right ?is this advisable while going through complex problem set like these?

AISHWARYA.M-wzxw
Автор

i didnt understand bool vote function. can you simulate for 2 candidates alice and bob and 2 voters please... it has i < 2 and no dimesion so it ll have 1 loop 2 steps... how can this function covers all voters and ranks...is there any recursion somewhere what did i miss...

btw thank you for your all tutorials.

wreiden
Автор

Hi Devin, I'm curious about the preferences array. I don't understand how that can be an index in the candidates array? Does it represent the int (vote count)? Sorry if this question is unclear. Thanks for your help!

jonathonhunt
Автор

thank you very muchhh! now i can see what wrong with my code

lucasnahp
Автор

Im confused about the use of a break in the tabulate section if someone could elaborate a little 🙏🏾

naruparagreendbz
welcome to shbcf.ru