Cs50 Tideman Solution Guide
CS50 Tideman problem set, the most challenging "feature" to develop is the lock_pairs
The Logic:
I realized I needed a recursive function. The prompt asks: Does locking this pair create a cycle? Cs50 Tideman Solution
#include <cs50.h> #include <stdio.h> #include <string.h> CS50 Tideman problem set, the most challenging "feature"
# Eliminate the candidate(s) with the fewest votes eliminated_candidates = [] while len(min_vote_candidates) > 0: eliminated_candidate = min_vote_candidates[0] eliminated_candidates.append(eliminated_candidate) candidates.remove(eliminated_candidate) CS50 Tideman problem set