Question

*R 2B PROGRAM 1B: INSERTION SORT Find and rix errors. Ron the program once and save the outpat as a conment at the end of the source file Changed by: IDE #include <iostream> using namespace std: void insertionSort (int aryll, int size) int main double list(1001-(50.1, 30.2, 80.3, 10.5, 30.2, 40.9, 90.8, 30.2, 80.8, 30.51 int size = 10; for (int í = 0; i < size; i++) cout<< listi <<" cout << endl: void insertionSort (int array, int size) for (int íー0: i < size: i++) cout << list[i] << " "; cout << endl: return 0:

C++ problem. Please just find and fix the errors and highlight it afterwards. Do not add any new comments or remove comments from teachers. Thank you very much

Answer 1

Hi,
Thank you for the opportunity to help you with your assignment.

The following is the code for your requirements as in the instructions.
The output and screenshot is at end of this answer.

I have made sure to include all that is necessary for you to complete this assignment.
In case, if something is missing, drop me a comment.

If you have any queries, need changes in the code or need help in following the code, leave me a comment.
I will reply within reasonable time.

If this answer helps you with your assignment, do upvote it.
Your vote will motivate me to work better.

Here is the code.
//File: program1b.cpp

#include <iostream>
using namespace std;
void insertionSort(double ary[], int size);
int main() {
double list[100] = {50.1, 30.2, 80.3, 10.5, 30.2, 40.9, 90.8, 30.2, 80.8, 30.5};
int size = 10;
for(int i = 0; i < size; i++) {
cout << list[i] << " ";
}
cout << endl;
insertionSort(list, size);
for(int i = 0; i < size; i++) {
cout << list[i] << " ";
}
cout << endl;
return 0;
}
void insertionSort(double ary[], int size) {
double temp;
int curr;
int walk;
for(curr = 1; curr < size; curr++) {
temp = ary[curr];
walk = curr - 1;
while(walk >= 0 && temp > ary[walk]) {
ary[walk+1] = ary[walk];
walk--;
}
ary[walk+1] = temp;
}
}

And here is the output when you execute the code
//Output:

List of changes

===============

1. Missing semicolon in function declaration
2. Not invoking the insertionSort function in the main function. Instead of void insertionSort(int array[], int size); should use insertionSort(list, size);
3. The array values provided in the main function is of double type, hence we need to change the first parameter in insertionSort function declaration and definition as double. That is - void insertionSort(double ary[], int size);
4. The data type of temp variable that is used to store the value of the array must be declared as double.
5. According to the comments, the insertionSort function is supposed to sort the array in descending order. But it sorts in ascending order. To fix that issue, we need to change the condition in the "while" statement as follows - while(walk >= 0 && temp > ary[walk]) {

Answer 2

Hi,
Thank you for the opportunity to help you with your assignment.

The following is the code for your requirements as in the instructions.
The output and screenshot is at end of this answer.

I have made sure to include all that is necessary for you to complete this assignment.
In case, if something is missing, drop me a comment.

If you have any queries, need changes in the code or need help in following the code, leave me a comment.
I will reply within reasonable time.

If this answer helps you with your assignment, do upvote it.
Your vote will motivate me to work better.

Here is the code.
//File: program1b.cpp

#include <iostream>
using namespace std;
void insertionSort(double ary[], int size);
int main() {
double list[100] = {50.1, 30.2, 80.3, 10.5, 30.2, 40.9, 90.8, 30.2, 80.8, 30.5};
int size = 10;
for(int i = 0; i < size; i++) {
cout << list[i] << " ";
}
cout << endl;
insertionSort(list, size);
for(int i = 0; i < size; i++) {
cout << list[i] << " ";
}
cout << endl;
return 0;
}
void insertionSort(double ary[], int size) {
double temp;
int curr;
int walk;
for(curr = 1; curr < size; curr++) {
temp = ary[curr];
walk = curr - 1;
while(walk >= 0 && temp > ary[walk]) {
ary[walk+1] = ary[walk];
walk--;
}
ary[walk+1] = temp;
}
}

And here is the output when you execute the code
//Output:

$G program1b.cppx TERMINAL 1: cmd #include <iostream > E:ws\vscodelcpp>g++ program1b.cpp && а.exe 58.1 38.2 88.3 10.5 30.2 40.9 90.8 30.2 80.8 38.5 90.8 80.8 80.3 50.1 48.9 30.5 30.2 30.2 30.2 18.5 3 using namespace std; 4 5 void insertionSort (double ary[], int size): 6 7 int main) E: lwslvscode lcpp double list [100]50.1, 30.2, 80.3, 10.5, 30.2, 40.9, 90.8, 30.2, 80.8, 30.5; int size 1; 10 for(int í ー 0; i < size; i++) { cout << list[i] << ; 12 13 14 15 16 17 18 19 20 21 cout << endl; insertionSort (list, size); for(int í ー 0; i < size; i++) { cout <<list[i]<< cout << endl; 23 24. 25 26 void insertionSort (double ary], int size) 27 28 29 30 31 32 return e double temp; int curr: int walk; for(curr-1; currくsize; curr++) { temp ary[curr];$

List of changes

===============

1. Missing semicolon in function declaration
2. Not invoking the insertionSort function in the main function. Instead of void insertionSort(int array[], int size); should use insertionSort(list, size);
3. The array values provided in the main function is of double type, hence we need to change the first parameter in insertionSort function declaration and definition as double. That is - void insertionSort(double ary[], int size);
4. The data type of temp variable that is used to store the value of the array must be declared as double.
5. According to the comments, the insertionSort function is supposed to sort the array in descending order. But it sorts in ascending order. To fix that issue, we need to change the condition in the "while" statement as follows - while(walk >= 0 && temp > ary[walk]) {