Imagine you have a list top_scores list that can store only 5 numbers. Implement an algorithm in Python that simulates a high score leaderboard in a game. The high score leaderboard tracks the top 5 scores that have been posted so far. The behaviour of your program should mimic a leaderboard. Make suitable assumptions if necessary but write them in your solution, Use the following starter code import random # empty list top_scores= [] # loop that generates 50 random numbers for i in range(50): # generate a random number rand_num = random.randint(0,100) # add your code here • Your code should add the random number generated to the list top_scores only if the random number is a new high score. A new high score is when the new number is among the top 5 scores observed so far. Think in terms of a high score board in your favourite game. • Think in terms of what will happen when your list has less than 5 elements. • For example, if the list currently has [10,12,5,9,11] and the new number generated is 42, then 42 will get added and the lowest number 5 will get replaced. so the list will be [10,12,42,9,11]. If the next number generated is 3, nothing will happen as 3 is lesser than all the numbers in the list.
Imagine you have a list top_scores list that can store only 5 numbers. Implement an algorithm in Python that simulates a high score leaderboard in a game. The high score leaderboard tracks the top 5 scores that have been posted so far. The behaviour of your program should mimic a leaderboard. Make suitable assumptions if necessary but write them in your solution, Use the following starter code import random # empty list top_scores= [] # loop that generates 50 random numbers for i in range(50): # generate a random number rand_num = random.randint(0,100) # add your code here • Your code should add the random number generated to the list top_scores only if the random number is a new high score. A new high score is when the new number is among the top 5 scores observed so far. Think in terms of a high score board in your favourite game. • Think in terms of what will happen when your list has less than 5 elements. • For example, if the list currently has [10,12,5,9,11] and the new number generated is 42, then 42 will get added and the lowest number 5 will get replaced. so the list will be [10,12,42,9,11]. If the next number generated is 3, nothing will happen as 3 is lesser than all the numbers in the list.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
![Imagine you have a list top_scores list that can store only 5 numbers. Implement an algorithm in Python
that simulates a high score leaderboard in a game. The high score leaderboard tracks the top 5 scores that
have been posted so far. The behaviour of your program should mimic a leaderboard. Make suitable
assumptions if necessary but write them in your solution, Use the following starter code
import random
# empty list
top_scores= []
# loop that generates 50 random numbers
for i in range(50):
# generate a random number
rand_num = random.randint(0,100)
# add your code here
Your code should add the random number generated to the list top_scores only if the random number is
a new high score. A new high score is when the new number is among the top 5 scores observed so far.
Think in terms of a high score board in your favourite game.
Think in terms of what will happen when your list has less than 5 elements.
For example, if the list currently has [10,12,5,9,11] and the new number generated is 42, then 42 will
get added and the lowest number 5 will get replaced. so the list will be [10,12,42,9,11]. If the next
number generated is 3, nothing will happen as 3 is lesser than all the numbers in the list.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F842ddfb5-3cba-4856-a7b3-78a95dca4dd5%2Fe665f1ce-c5f3-44d1-9af9-6fd772e1c0f0%2Fxmzc057_processed.png&w=3840&q=75)
Transcribed Image Text:Imagine you have a list top_scores list that can store only 5 numbers. Implement an algorithm in Python
that simulates a high score leaderboard in a game. The high score leaderboard tracks the top 5 scores that
have been posted so far. The behaviour of your program should mimic a leaderboard. Make suitable
assumptions if necessary but write them in your solution, Use the following starter code
import random
# empty list
top_scores= []
# loop that generates 50 random numbers
for i in range(50):
# generate a random number
rand_num = random.randint(0,100)
# add your code here
Your code should add the random number generated to the list top_scores only if the random number is
a new high score. A new high score is when the new number is among the top 5 scores observed so far.
Think in terms of a high score board in your favourite game.
Think in terms of what will happen when your list has less than 5 elements.
For example, if the list currently has [10,12,5,9,11] and the new number generated is 42, then 42 will
get added and the lowest number 5 will get replaced. so the list will be [10,12,42,9,11]. If the next
number generated is 3, nothing will happen as 3 is lesser than all the numbers in the list.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education