• 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 I tple 2 Sort array in ascenting order 3 include iestrean 4 aclude estring S using nanespace std, iet nain() int a(1e)-(32, 23, 43, 21, 39, 31, 15, 34, 38, 14); Int tene far pine 10 11- for(int i e , for(int 1-1+1 i/ompare utth et eleent onards 1S proces starts /stere first eleset tep-ali: Istere the second element ito first al1)-ten Istere the temp (has first) into second 17 Elements are spped 18 19 20 21 22 /print serted array for(int ie; ie; ) coutal1 23 12

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
I need some help coding this in c++. Please and thank you
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
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
10:28 A
令.all 32%
M8- Arrays 2 - Read-only
cample 6
1 / M8- Example 6
// Sort array in ascending order
2
3.
#include <iostream>
#include <string>
5 using namespace std;
4
int main()
int a[10]={32, 23, 43, 21, 39, 31, 15, 34, 38, 14};
int temp; //for swapping
for(int i=0; i<1®; i++){
for (int j-1+1; j<1@;j++){//compare with next element onwards
10
11.
12-
if(a[i]>a[j]){
temp-a[i];
a[i]-a[j];
a[j]-temp;
13-
14
//SWAP process starts
//store first element
//store the second element into first
//store the temp (has first) into second
//Elements are swapped
15
16
17
18
19
20
//print sorted array
for(int i=0; i<l®; i++)
cout<ca[1]<<" ";
21
22
23 }
12
cample 7
ke the sorting code as a function
. This function will also print the
ion in main (). Use the same array
portion of what the main () looks
move the sort code from evamnle 6.
Transcribed Image Text:10:28 A 令.all 32% M8- Arrays 2 - Read-only cample 6 1 / M8- Example 6 // Sort array in ascending order 2 3. #include <iostream> #include <string> 5 using namespace std; 4 int main() int a[10]={32, 23, 43, 21, 39, 31, 15, 34, 38, 14}; int temp; //for swapping for(int i=0; i<1®; i++){ for (int j-1+1; j<1@;j++){//compare with next element onwards 10 11. 12- if(a[i]>a[j]){ temp-a[i]; a[i]-a[j]; a[j]-temp; 13- 14 //SWAP process starts //store first element //store the second element into first //store the temp (has first) into second //Elements are swapped 15 16 17 18 19 20 //print sorted array for(int i=0; i<l®; i++) cout<ca[1]<<" "; 21 22 23 } 12 cample 7 ke the sorting code as a function . This function will also print the ion in main (). Use the same array portion of what the main () looks move the sort code from evamnle 6.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 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