Complete the following sorting program with bubble sort algorithm. #include using namespace std; template void Print...

Transcribed Image Text:

Complete the following sorting program with bubble sort algorithm. #include <iostream> using namespace std; template <class T> void Print (T& vec, int n, string s) { cout << s << ": [" << flush; } for (int i=0; i<n; i++) { cout << vec[i] << flush; if (i <n-1) { cout << ", " << flush; } } cout << "]" << endl; 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; [10 m Complete the following sorting program with bubble sort algorithm. #include <iostream> using namespace std; template <class T> void Print (T& vec, int n, string s) { cout << s << ": [" << flush; } for (int i=0; i<n; i++) { cout << vec[i] << flush; if (i <n-1) { cout << ", " << flush; } } cout << "]" << endl; 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; [10 m

Answer rating: 100% (QA)

include using namespace std template void PrintT vec int n string s cout s flush for int i ... View the full answer