Write a C++ program that reads a maximum of 100 integers from the keyboard, stores them in a long array, sorts the integers in ascending order, and displays sorted output. Input can be terminated by any invalid input, such as a letter. HINT: Use the bubble sort algorithm to sort the array. This algorithm repeatedly accesses the array, comparing neighboring array elements and swapping them if needed. The sorting algorithm terminates when there are no more elements that need to be swapped. You use a flag to indicate that no elements have been swapped. Example of bubble sort algorithm:

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
Exercise
Write a C++ program that reads a maximum of 100 integers from the keyboard,
stores them in a long array, sorts the integers in ascending order, and displays
sorted output. Input can be terminated by any invalid input, such as a letter.
HINT:
Use the bubble sort algorithm to sort the array. This algorithm repeatedly
accesses the array, comparing neighboring array elements and swapping them
if needed. The sorting algorithm terminates when there are no more elements
that need to be swapped. You use a flag to indicate that no elements have been
swapped. Example of bubble sort algorithm:
Original array:
100
50
30
70
40
After the first loop:
50
30
70
40
||
100
largest element T
After the second loop:
||
30
50
40
70
100
second largest element
Transcribed Image Text:Exercise Write a C++ program that reads a maximum of 100 integers from the keyboard, stores them in a long array, sorts the integers in ascending order, and displays sorted output. Input can be terminated by any invalid input, such as a letter. HINT: Use the bubble sort algorithm to sort the array. This algorithm repeatedly accesses the array, comparing neighboring array elements and swapping them if needed. The sorting algorithm terminates when there are no more elements that need to be swapped. You use a flag to indicate that no elements have been swapped. Example of bubble sort algorithm: Original array: 100 50 30 70 40 After the first loop: 50 30 70 40 || 100 largest element T After the second loop: || 30 50 40 70 100 second largest element
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Knowledge Booster
Randomized Select Algorithm
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