Tier 1 · Parsons problem
Rebuild the biggest function
Order the lines
Drag the lines into the order that finds the largest number.
- ::
best = nums[0] - ::
if n > best: - ::
def biggest(nums): - ::
return best - ::
for n in nums: - ::
best = n
All activitiesAll activitiesDrag the lines into the order that finds the largest number.
best = nums[0] if n > best:def biggest(nums): return best for n in nums: best = n