A unique bid auction accepts an unlimited number of bids from many customers (each of whom pay a small amount to place each bid), and the winning bid is the lowest bid which is submitted by just one person (i.e. the lowest unique bid). Define a function called winning_bid (bids_list) which takes as input the list of all bids that have been made in the auction. The value returned by your function should be the lowest unique bid. If there is no lowest unique bid (in other words, if all bids appear more than once) then the function should return -1. For example, given the following bids: [3, 7, 5, 6, 3, 4, 8, 4, 5, 8, 12, 11] the winning bid is 6 as it is the lowest unique bid (because 3, 4 and 5 all appear more than once in the list of bids). For example: Test Result print(winning bid([1, 2, 3, 4, 5])) 1 print(winning bid([1, 2, 1, 4, 5])) 2 print(winning bid([1, 2, 1, 2, 5])) 5 print(winning bid([1, 1, 1, 4, 1])) 4

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
icon
Related questions
Question
Question 9
Not complete
Marked out of
1.00
Flag question
A unique bid auction accepts an unlimited number of bids from many customers (each of whom pay a small amount to place each bid), and the winning bid is the lowest bid which is submitted
by just one person (i.e. the lowest unique bid).
Define a function called winning_bid (bids_list) which takes as input the list of all bids that have been made in the auction. The value returned by your function should be the lowest unique
bid. If there is no lowest unique bid (in other words, if all bids appear more than once) then the function should return -1. For example, given the following bids:
[3, 7, 5, 6, 3, 4, 8, 4, 5, 8, 12, 11]
the winning bid is 6 as it is the lowest unique bid (because 3, 4 and 5 all appear more than once in the list of bids).
For example:
Test
print (winning_bid([1, 2, 3, 4, 5]))
print (winning_bid([1, 2, 1, 4, 5]))
print(winning_bid([1, 2, 1, 2, 5]))
print(winning_bid([1, 1, 1, 4, 1]))
Result
1
2
5
4
Transcribed Image Text:Question 9 Not complete Marked out of 1.00 Flag question A unique bid auction accepts an unlimited number of bids from many customers (each of whom pay a small amount to place each bid), and the winning bid is the lowest bid which is submitted by just one person (i.e. the lowest unique bid). Define a function called winning_bid (bids_list) which takes as input the list of all bids that have been made in the auction. The value returned by your function should be the lowest unique bid. If there is no lowest unique bid (in other words, if all bids appear more than once) then the function should return -1. For example, given the following bids: [3, 7, 5, 6, 3, 4, 8, 4, 5, 8, 12, 11] the winning bid is 6 as it is the lowest unique bid (because 3, 4 and 5 all appear more than once in the list of bids). For example: Test print (winning_bid([1, 2, 3, 4, 5])) print (winning_bid([1, 2, 1, 4, 5])) print(winning_bid([1, 2, 1, 2, 5])) print(winning_bid([1, 1, 1, 4, 1])) Result 1 2 5 4
Expert Solution
Step 1

Hello,

It is just an implementation of your given function not complete because you just asked for a function and how to implement it. and it is working fine for me.

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Function Arguments
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education