Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Problem 2: Intermediate Selection/Logic * You have been dealt two cards, a and b. Each card has a value 0-100. Set the variable nearest to whichever value is nearest to 21 without going over. Return 0 if both cards go over. Examples: } nearest (19, 21)→ 21 nearest (21, 19) → 21 nearest (19, 22)→ 19 */ int nearest(int a, int b) { int nearest = 0; // YOUR CODE GOES ONLY BELOW THIS LINE // Add your code here return nearest;

Problem 2: Intermediate Selection/Logic * You have been dealt two cards, a and b. Each card has a value 0-100. Set the variable nearest to whichever value is nearest to 21 without going over. Return 0 if both cards go over. Examples: } nearest (19, 21)→ 21 nearest (21, 19) → 21 nearest (19, 22)→ 19 */ int nearest(int a, int b) { int nearest = 0; // YOUR CODE GOES ONLY BELOW THIS LINE // Add your code here return nearest;

Database System Concepts
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
See similar textbooks
icon
Related questions
Question

Need help with this c++ code

/** Problem 2: Intermediate Selection/Logic You have been dealt two cards, a and b. Each card has a value 0-100. Set the variable nearest to whichever value is nearest to 21 without going over. Return 0 if both cards go over. } Examples: nearest (19, 21)→ 21 nearest (21, 19) → 21 nearest(19, 22) → 19 */ int nearest (int a, int b) { int nearest = 0; // ---- YOUR CODE GOES ONLY BELOW THIS LINE // Add your code here return nearest;
Transcribed Image Text:/** Problem 2: Intermediate Selection/Logic You have been dealt two cards, a and b. Each card has a value 0-100. Set the variable nearest to whichever value is nearest to 21 without going over. Return 0 if both cards go over. } Examples: nearest (19, 21)→ 21 nearest (21, 19) → 21 nearest(19, 22) → 19 */ int nearest (int a, int b) { int nearest = 0; // ---- YOUR CODE GOES ONLY BELOW THIS LINE // Add your code here return nearest;
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Random Class and its operations
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
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
SEE MORE TEXTBOOKS