Complete the following sorting program with bubble sort algorithm.#include using namespace std;template void Print (T& vec, int n, string s) {cout << s << ": [" << flush;for (int i=0; i void swap (int* x, int* y) {//complete the code}void BubbleSort (int A[], int n) {//complete the code}int main() {int A[] (3, 7, 9, 10, 6, 5, 12, 4, 11, 2);int n = sizeof (A) /sizeof (A [0]);Print (A, n, "\t\tA");BubbleSort (A, n);Print (A, n, "Sorted A");return 0;

Here is the c++ Code: See below steps:

Answered: Complete the following sorting program…

Complete the following sorting program with bubble sort algorithm. #include using namespace std; template void Print (T& vec, int n, string s) { cout << s << ": [" << flush; for (int i=0; i

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

See similar textbooks

Similar questions

complete the //TODOs #include<iostream> #include "swap.h" using namespace std; int main(int argc, char const *argv[]) { intfoo[5] = {1, 2, 3, 4, 5}; cout<<"Addresses of elements:"<<endl; //TODO Print the addresses of array elements cout<<endl; cout<<"Elements:"<<endl;; //TODO Print all the elements using pointers cout<<endl; inta,b; intf; intflag = 1; while(flag == 1){ cout<<"Enter indices of elements you want to swap?"<<endl; cout<<"First index"<<endl; cin>>a; cout<<"Second index"<<endl; cin>>b; cout<<"Enter 0 for pass-by-value, 1 for pass-by-pointer"<<endl; cin>>f; switch (f) { case0: // Pass by Value // Compare the resultant array with the array you get after passing by pointer cout<<"Before swapping"<<endl; for(inti = 0;i<5;i++){ cout<<foo[i]<<" "; } cout<<endl; swap(foo[a],foo[b]); cout<<"\nAfter swapping"<<endl;…
#include<iostream>#include<stdlib.h>#include<time.h>#include<bits/stdc++.h>using namespace std; void merge(int arr[], int l, int m, int r){ int n1 = m - l + 1; int n2 = r - m; int L[n1], R[n2]; for (int i = 0; i < n1; i++) L[i] = arr[l + i]; for (int j = 0; j < n2; j++) R[j] = arr[m + 1 + j]; int i = 0; int j = 0; int k = l; while (i < n1 && j < n2) { if (L[i] <= R[j]) { arr[k] = L[i]; i++; } else { arr[k] = R[j]; j++; } k++; } while (i < n1) { arr[k] = L[i]; i++; k++; } while (j < n2) { arr[k] = R[j]; j++; k++; }} void mergeSort(int arr[],int l,int r){ if(l>=r){ return; } int m =l+ (r-l)/2; mergeSort(arr,l,m); mergeSort(arr,m+1,r); merge(arr,l,m,r);} int main(){ srand(time(0)); long int n; cout<<"Enter the number of…
#include <iostream>#include <vector>using namespace std; void PrintVectors(vector<int> numsList) { unsigned int i; for (i = 0; i < numsList.size(); ++i) { cout << numsList.at(i) << " "; } cout << endl;} int main() { vector<int> numsList; int userInput; int i; for (i = 0; i < 3; ++i) { cin >> userInput; numsList.push_back(userInput); } numsList.erase(numsList.begin()+1); numsList.insert(numsList.begin()+1, 102); numsList.insert(numsList.begin()+1, 100); PrintVectors(numsList); return 0;} Not all tests passed clearTesting with inputs: 33 200 10 Output differs. See highlights below. Special character legend Your output 33 100 102 10 Expected output 100 33 102 10 clearTesting with inputs: 6 7 8 Output differs. See highlights below. Special character legend Your output 6 100 102 8 Expected output 100 6 102 8 Not sure what I did wrong but the the 33…
What 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;
Use iterators to print each element of v separted by spaces. #include <iostream>#include <vector> using namespace std; int main(){vector<int> v = {1, 3, 5}; (.....) }
#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.
#include<iostream>#include<stdlib.h>#include<time.h>#include<bits/stdc++.h>using namespace std; void merge(int arr[], int l, int m, int r){ int n1 = m - l + 1; int n2 = r - m; int L[n1], R[n2]; for (int i = 0; i < n1; i++) L[i] = arr[l + i]; for (int j = 0; j < n2; j++) R[j] = arr[m + 1 + j]; int i = 0; int j = 0; int k = l; while (i < n1 && j < n2) { if (L[i] <= R[j]) { arr[k] = L[i]; i++; } else { arr[k] = R[j]; j++; } k++; } while (i < n1) { arr[k] = L[i]; i++; k++; } while (j < n2) { arr[k] = R[j]; j++; k++; }} void mergeSort(int arr[],int l,int r){ if(l>=r){ return; } int m =l+ (r-l)/2; mergeSort(arr,l,m); mergeSort(arr,m+1,r); merge(arr,l,m,r);} int main(){ srand(time(0)); long int n; cout<<"Enter the number of…
In C programming. How do I find the max and min values of the corressponding columns. #include <stdio.h>#include <math.h>#include <stdlib.h>#define NROWS 5#define NCOLS 5 int main(void){ int i,j, max, min, m, n; float M[NROWS][NCOLS], Mt[NROWS][NCOLS]; char key_hit; //Input the sizes printf("ROW size(1-5) : ");scanf("%d",&m); printf("Column size(1-5): ");scanf("%d",&n); //Size Check while(m>NROWS || n>NCOLS) { printf("Please re-enter the sizes. \n"); printf("Row size(1-5) : ");scanf("%d", &m); printf("Column size(1-5) : ");scanf("%d", &n); } //Input the Matrix Data for(i=0; i<m; i++) for(j=0; j<n; j++) { printf("M[%d][%d] = ", i,j); scanf("%f", &M[i][j]); } //Print the Matrix Data for(i=0; i<m; i++) { for(j=0; j<n; j++) { printf("%1.2f\t", M[i][j]); }…
# viewGame(G, i) takes a game description G (a dictionary of the type# produced by newGame()) and an integer player index i and returns a# string that, when printed, describes the state of the game from# player i's perspective.## Example:# >>> viewGame(G, 1)# '\nPlayer2 to play (score=0):\n 1[ ] 2[ ] 3[ ]'## Note the spacing and explicit newlines, and the fact that the player# numbers use 1-based indexing even though internally the game data# structures use Pythonic 0-based indexing.
can someone help me with this in C++ You'll need to complete the following two step: implement bubble sort algorithms as a function. call the bubble sort function in the main.this is the code I have so far #include <iostream> #include <vector> using namespace std; void get_value(int *ptr, int size){ for(int i=0; i < size; i++){ ptr[i] = rand() % 100; }} void bubble_sort(int *ptr, int size){ //complete the code } int main(){ int *myarray = new int[10]; get_value(myarray, 10); //implement a bubble sort function to sort the array return 0;}
#include #include using namespace std; void PrintSize(vector numsList) { cout intList (3); PrintSize(intList); cin >> currval; while (currval >= 0) { } Type the program's output intList.push_back(currval); cin >> currVal; PrintSize(intList); intList.clear(); PrintSize(intList); return 0; 1 se mice with camScanner Check Next Input 1234-1 Output
def large_rec(m: list[list[int]], r: int, c: int) -> int:"""Do not use any imports, dictionaries, try-except statements or break and continue please you must make use of the helper long here as you loop througheach row of the matrix returns the area of the largest rectangle whose top left corner is atposition r, c in m.>>> case1 = [[1, 0, 1, 0, 0],... [1, 0, 1, 1, 1],... [1, 1, 1, 1, 1],... [1, 0, 0, 1, 0]]>>> largest_at_position(case1, 1, 2)6""" Helper code: def long(lst: list[int]) -> int: count = 0i = 0while i < len(lst) and lst[i] != 0:i = i + 1count = count + 1return count