
Concept explainers
Write a

Largest and Smallest numbers
Program Plan:
- Include the required headers.
- Define “main()” method.
- Declare the required “int” and “char” variables.
- Prompt the user for input file.
- Read the required input file.
- Create the object for “ifstream”.
- Open the required file.
- Check the file can be opened or not using “if” condition.
- If the file includes any error, print file “cannot be opened”.
- Initialize the input and check for largest and smallest numbers present in the file.
- Print the output using “cout”
- Return the required variable.
- Close the “main()” method.
The below C++ program describes about the displaying of largest and smallest values among the numbers present in a given file.
Explanation of Solution
Program:
//Include the needed headers
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <climits>
using namespace std;
//main() Method
int main()
{
//Declaration of int variable sum
int sum = 0;
//Declaration of char variable file_name
char file_name [31];
//Declaration of input and index
int input, i = 0;
//Declaration of largest
int largest = -INT_MAX;
//Declaration of smallest
int smallest = INT_MAX;
//prompt the user for input file name
cout << "Enter a file name."
<< " This Program limits file names to"
<< endl
<< " a maximum of 30 characters. " << endl;
//read the input file name
cin >> file_name;
//creating object for ifstream
ifstream infile;
//a handle for opening the input file
infile.open(file_name);
//check the condition
if(!infile)
{
//display the error
cout << "Cannot open file " << file_name
<< " Aborting program " << endl;
//stop and exit
exit (1);
}
//initialize the input
infile >> input;
//start the loop
while(infile)
{
//check the condition
if(input > largest)
//get the largest value
largest = input;
//check the file
if(input < smallest)
//get the smallest value
smallest = input;
cout << input << " " << endl;
infile >> input;
}
//display the output
cout << "smallest in file = " << smallest
<< " largest in file = " << largest << endl;
getchar();
getchar();
//return the required value
return 0;
}
Output:
Want to see more full solutions like this?
Chapter 6 Solutions
Problem Solving with C++ (10th Edition)
Additional Engineering Textbook Solutions
Elementary Surveying: An Introduction To Geomatics (15th Edition)
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)
Concepts Of Programming Languages
SURVEY OF OPERATING SYSTEMS
Degarmo's Materials And Processes In Manufacturing
- HW: a sewer carry flow = 600 l/s at 34 full at max WWF and 150 l/s at min DWF. Determine the diameter and minimum slope. Then get velocity and depth of sewage flow at max WWF and DWF. Use Vmin = 0.6m/s.arrow_forwardGeneral accountingarrow_forwardJOB UPDATE Apply on- VinkJobs.com @ OR Search "Vinkjobs.com" on Google COMPANY JOB PROFILE JOB LOCATION INTELLIFLO APPLICATION DEVELOPER MULTIPLE CITIES GLOBAL LOGIC SOFTWARE ENGINEER/SDET DELHI NCR SWIGGY SOFTWARE DEVELOPMENT BENGALURU AVALARA SOFTWARE ENGINEER (WFH) MULTIPLE CITIES LENSKART FULL STACK DEVELOPER MULTIPLE CITIES ACCENTURE MEDPACE IT CUST SERVICE SOFTWARE ENGINEER MUMBAI MUMBAI GENPACT BUSINESS ANALYST DELHI NCR WELOCALIZE WORK FROM HOME MULTIPLE CITIES NTT DATA BPO ASSOCIATE DELHI NCRarrow_forward
- +is+how+many+tree+in+ipl&rlz=1C1GCEA_enIN1122IN1122&oq=1+dot+ball+is+how+many+tree+in Google 1 dot ball is how many tree in ipl All Images News Videos Short videos Shopping Web More 500 trees 4) हिन्दी में In English The step was a part of the Board of Control for Cricket in India's green initiative. The BCCI, having partnered with the Tata Group, has promised to plant as many as 500 trees for every dot ball bowled in the Indian Premier League. 25 Mar 2025 Sportstar https://sportstar.thehindu.com > Cricket IPL IPL News IPL 2025: Why are green tree symbols showing up for every ... A Translate to fo-d About featured snippets . Feedback Toolsarrow_forwardPastner Brands is a calendar-year firm with operations in several countries. As part of its executive compensation plan, at January 1, 2024, the company issued 480,000 executive stock options permitting executives to buy 480,000 shares of Pastner stock for $38 per share. One-fourth of the options vest in each of the next four years beginning at December 31, 2024 (graded vesting). Pastner elects to separate the total award into four groups (or tranches) according to the year in which they vest and measures the compensation cost for each vesting date as a separate award. The fair value of each tranche is estimated at January 1, 2024, as follows: Vesting Date Amount Fair Value Vesting per Option: December 31, 2024 25% $ 3.90 December 31, 2025 25% $ 4.40 25% $ 4.90 25% $ 5.40 December 31, 2026 December 31, 2027 Required: 1. Determine the compensation expense related to the options to be recorded each year 2024-2027, assuming Pastner allocates the compensation cost for each of the four…arrow_forwardWhat is one benefit with regards to time complexity of using a Doubly Linked List as opposed to an Array when implementing a Deque?arrow_forward
- What is one benefit with regards to space complexity of using a Doubly Linked List as opposed to an Array when implementing a Deque?arrow_forwardWhich basic data structure (Doubly Linked List, Singly Linked List, Array) would you use to implement a Stack? Why?arrow_forwardDid you comment all methods in the Deque class to include 1. The method's behavior 2. Arguments that are passed to the method (if any), their expected types, and what they are used for 3. What the method returns (if any) 4. A description of the behavior of each line in the methodarrow_forward
- EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENTC++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage LearningProgramming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
- Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology PtrCOMPREHENSIVE MICROSOFT OFFICE 365 EXCEComputer ScienceISBN:9780357392676Author:FREUND, StevenPublisher:CENGAGE L



