Need help answering example 8, the code is from number 7 for assistance. Write in c++
Need help answering example 8, the code is from number 7 for assistance. Write in 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
Related questions
Question
Need help answering example 8, the code is from number 7 for assistance. Write in c++
![1:17
* ll 56%A
Code Screenshot:
main.cpp
1 #include <iostream>
2 #include <string>
3 using namespace std;
4 void fSortAsc(int a[], int length)
5- {
6 int temp;
7- for (int i=0;i<1®;i++){
for(int j-i+1; j<10;j++){
if (a[i]
{
temp = a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
for (int i=0;i<1®;i++){
cout<<a[i]<<" ";
}
8
a[j])
10
11
14
15
16
17
18
20 }
22 int main(()
23 - {
int a[10]={32, 23, 43, 21, 39, 31, 15, 34, 38, 14};
fsortAsc(a,10);
24
25
26 }|
Step3
c)
Output:
14 15 21 23 31 32 34 38 39 43
...Program finished with exit code 0
Press ENTER to exit console.]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F83f8fd0e-20e0-4045-b7e0-eac2c26a0bae%2Fc3d1d158-79dc-4f71-8af8-b397f83bdab5%2Ffn8nhv_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1:17
* ll 56%A
Code Screenshot:
main.cpp
1 #include <iostream>
2 #include <string>
3 using namespace std;
4 void fSortAsc(int a[], int length)
5- {
6 int temp;
7- for (int i=0;i<1®;i++){
for(int j-i+1; j<10;j++){
if (a[i]
{
temp = a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
for (int i=0;i<1®;i++){
cout<<a[i]<<" ";
}
8
a[j])
10
11
14
15
16
17
18
20 }
22 int main(()
23 - {
int a[10]={32, 23, 43, 21, 39, 31, 15, 34, 38, 14};
fsortAsc(a,10);
24
25
26 }|
Step3
c)
Output:
14 15 21 23 31 32 34 38 39 43
...Program finished with exit code 0
Press ENTER to exit console.]
Transcribed Image Text:unction
10:28
all 32%
Example 6
Sort the following array in
an ascending order. int
array {32, 23, 43, 21, 39,
31, 15, 34, 38, 14}. Use
the algorithm given on the
last slide.
1 / Example
// Sort array in ascending order
tinclude ciostrean
4 laclude cstring
using nanespace std,
int main()
int a[10)-(32, 23, 43, 21, 39, 31, 15, 34, 38, 14);
Int tene; //for spping
10
for(int i-e; ic1e; i
11-
12
for(int 1-1+1; k10:1++)(//compare with next elenent onards
teno-al1):
/SAP process starts
(/store fiest elesest
14
15
I/store the second element into first
(/store the temp (has first) Into second
I/Elements are sapped
als)-temp
18
19
20
21
22
23 )
I/print serted array
for(int ie; i1e; i)
coute ca[1k :
12
Example 7
• Rewrite example 6 and make the sorting code as a function
fSortAsc(array, length). This function will also print the
sorted array. Call this function in main (). Use the same array
as in example 6. Here is a portion of what the main () looks
like for this example. Hint: move the sort code from example 6
to the function fSortAsc.
I/ MB Example 7
I/ Sort array function
include clostream
tinclude string
susing namespace std;
vodd fSortasc(int al), int length),
int mainO
int a[10)-(32, 23, 43, 21, 39, 31, 15, 34, 18, 14);
fSortáscia, 1a);
10
11
13
12 }
13
Example 8
• Continue example 7 and add the sorting of the array in
descending order as a function fSortDesc(array,length).
This function will also print the sorted array. Call this function
in main. Use the same array as in example 6. The main() must
look like this.
I H Ecample a
/ Sort array function
3 tinelude ciestream
4 Binclude cstring
using nanespace std;
veld fSortasc(int all, Int length);
7 void fSortDesc(int all, int length);
9 int nain()
19-
int a[101-(32, 23, 43, 21, 39, 31, 15, 34, 38, 14);
12 Sortáscia, 10)
ceutccendl;
14 Sortbesc(a,10):
15 }
11
14
14
Matrices- two dimensional arrays
A matrix is a table with rows and columns
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
Knowledge Booster
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
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education