
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
![?What is the output of the following code
#include<iostream>
using namespace std;
int main() {
int a[5] = {4, 3, 7, 5, 8};
int T = 0;
for (int i = 0; i < 5; i++){
for(int j = 0; j< 5-i-1; j++){
if(a[j] > a[j+1]){
T=a[j];
a[j]=a[j+1];
a[j+1]=T;
}
}
cout <« a[i];
}
None of them
87543
78345
34568](https://content.bartleby.com/qna-images/question/93f3ce6d-7ece-4878-a2a1-75c7d29ec96b/42f1bc4d-61bd-49d0-a595-bb6b59ce98e3/g27i4em_thumbnail.png)
Transcribed Image Text:?What is the output of the following code
#include<iostream>
using namespace std;
int main() {
int a[5] = {4, 3, 7, 5, 8};
int T = 0;
for (int i = 0; i < 5; i++){
for(int j = 0; j< 5-i-1; j++){
if(a[j] > a[j+1]){
T=a[j];
a[j]=a[j+1];
a[j+1]=T;
}
}
cout <« a[i];
}
None of them
87543
78345
34568
Expert Solution

arrow_forward
Introduction :-
Below is the executable code that i run on the compiler :-
#include<iostream>
using namespace std;
int main()
{
int a[5] = {4, 3, 7, 5, 8};
int T = 0;
for (int i = 0; i < 5; i++){
for(int j = 0; j < 5-i-1; j++){
if(a[j]> a[j+1]){
T=a[j];
a[j]=a[j+1];
a[j+1]=T;
}
}
cout << a[i];
}
}
Output :-
Below i attach the code output along with the screenshot of the output :-
Step by stepSolved in 2 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.Similar questions
- What does the below do? #include <stdio.h>#include <string.h>int main(void) { char fnameArray[50] [50]; int i; for (i = 0; i <=5; i++) { scanf("%s", fnameArray[i] ); } for (i = 0; i <=5; i++) { printf("\n%s\n", fnameArray[i] ); } return 0;}arrow_forwardWhat does the following code output? tinclude void pointerUpd (double* upt); int main() { double* pp; double b[6] = { 1.01, 2.02, 3.03, 4.04, 5.05 }; PP = 6 (b[4]); double *dp = pp; dp++; std::cout <« *dp < std::endl; std::cout « *pPp « std::endl; pointerUpd (pp) ; std::cout « *dp « std::endl; std::cout <« *pp << std::endl; void pointerUpd (double* upt) { * (++upt) = 6.06; upt = new double; *upt = 1.01;arrow_forwardPlease Help In JAVA Here is the skeleton of a code for insertion sorting in an imperative language. You have to add right lines of codes for the language you choose (C, C++, C#, JAVA etc,). The following sample is for C++. #include <iostream>#include <array>#include <stdio.h>#include <stdlib.h>#include <ctime>using namespace std; void insertionSort(int A[], int n){for (int i = n-2; i >= 0; i--){ int j; int v = A[i]; for (j = i + 1; j <= n-1; j++) { if (A[j] > v) break; else A[j-1] = A[j]; } A[j-1] = v;}} int *randomArray(int n){srand((unsigned) time(0));int * A = new int [n];for (int i = 0; i < n; i++){ A[i] = rand();}return A;} Sample function calls (call these functions in main driver function):int n = 100000;int * A = randomArray(n);insertionSort(A, n);delete [] A; Note: delete memory of first array before sorting second array. After you modify the code: (1) Generate 100, 000 random numbers and sort them (2) Generate 300000…arrow_forward
- #include <iostream> #include <string> #include <cstdlib> using namespace std; template<class T> T func(T a) { cout<<a; return a; } template<class U> void func(U a) { cout<<a; } int main(int argc, char const *argv[]) { int a = 5; int b = func(a); return 0; } Give output for this code.arrow_forwardC++arrow_forwardKindly fix the code:arrow_forward
- C programming fill in the following code #include "graph.h" #include <stdio.h>#include <stdlib.h> /* initialise an empty graph *//* return pointer to initialised graph */Graph *init_graph(void){} /* release memory for graph */void free_graph(Graph *graph){} /* initialise a vertex *//* return pointer to initialised vertex */Vertex *init_vertex(int id){} /* release memory for initialised vertex */void free_vertex(Vertex *vertex){} /* initialise an edge. *//* return pointer to initialised edge. */Edge *init_edge(void){} /* release memory for initialised edge. */void free_edge(Edge *edge){} /* remove all edges from vertex with id from to vertex with id to from graph. */void remove_edge(Graph *graph, int from, int to){} /* remove all edges from vertex with specified id. */void remove_edges(Graph *graph, int id){} /* output all vertices and edges in graph. *//* each vertex in the graphs should be printed on a new line *//* each vertex should be printed in the following format:…arrow_forwardThis is What i have so far. #include <iostream> // for cin and cout#include <iomanip> // for setw() and setfill()using namespace std; // so that we don't need to preface every cin and cout with std:: void printFirstTwoBuildingSection(int n, int startSpacing){int start = n / 2, end = 0;if (n <= 2){start = 0;}for (int i = 0; i < n; i++){for (int j = 0; j < startSpacing; j++){cout << " ";}cout << "|";if (i < (n / 2)){for (int k = 0; k < i; k++){cout << " ";}cout << "\\";for (int k = 0; k < start; k++){cout << " ";}cout << "/";start -= (n / 2);for (int k = 0; k < i; k++){cout << " ";}cout << "|" << endl;}else{for (int k = n - i - 1; k > 0; k--){cout << " ";}cout << "/";for (int k = 0; k < end; k++){cout << " ";}cout << "\\";end += (n / 2);for (int k = n - i - 1; k > 0; k--){cout << " ";}cout << "|" << endl;}}for (int j = 0; j < startSpacing;…arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education

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