Complete the following code. Programming Language: C++

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

Complete the following code.

Programming Language: C++

#include <iostream>
using namespace std;
Collapse
3
void bubleSort(int *a, int n);
void display (int *a, int n);
4
Sorting Algorithms
int main()
{
// your declarations here...
cout <« "Enter number of elements to be sorted: ";
//accept inputs...
7
Given the bubble sort algorithm at the left pane, do the
9
following:
10
11
12
1. Complete the main program.
13
cout <« "Enter the values ... \n";
14
2. Create a void function called display with 2 parameters: the
15
bubleSort (num, size);
array to be displayed and size.
16
}
17
3. Use a dynamic array of type int.
18
19
void bubleSort(int *a, int n)
{
int last =n - 1;
cout <« "\nBubble Sort..." << endl « endl;
for (int i = 0; i < last; i++)
{
20
21
To run and see the output of your program, click the button below...
22
23
24
TEST ME!
25
for (int j = last; j > i; j--)
if (a[j - 1] > a[j])
swap (a[j], a[j - 1]);
26
27
28
cout << "Pass " << i+1 << "...." << endl:
display (a, n);
cout << endl;
}
}
29
30
31
32
33
void display (int *a, int n)
{
34
35,
36
37
}
Transcribed Image Text:#include <iostream> using namespace std; Collapse 3 void bubleSort(int *a, int n); void display (int *a, int n); 4 Sorting Algorithms int main() { // your declarations here... cout <« "Enter number of elements to be sorted: "; //accept inputs... 7 Given the bubble sort algorithm at the left pane, do the 9 following: 10 11 12 1. Complete the main program. 13 cout <« "Enter the values ... \n"; 14 2. Create a void function called display with 2 parameters: the 15 bubleSort (num, size); array to be displayed and size. 16 } 17 3. Use a dynamic array of type int. 18 19 void bubleSort(int *a, int n) { int last =n - 1; cout <« "\nBubble Sort..." << endl « endl; for (int i = 0; i < last; i++) { 20 21 To run and see the output of your program, click the button below... 22 23 24 TEST ME! 25 for (int j = last; j > i; j--) if (a[j - 1] > a[j]) swap (a[j], a[j - 1]); 26 27 28 cout << "Pass " << i+1 << "...." << endl: display (a, n); cout << endl; } } 29 30 31 32 33 void display (int *a, int n) { 34 35, 36 37 }
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

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
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