Question

So. I'm sick and I need help figuring out whatever is going on with this.

#include

using namespace std;

//prototypes
int getExchangesInBubbleSort(int[], int);
int getExchangesInSelectionSort(int[], int);

int main()
{
   char choice;
  

   cout << "1. Search Benchmarks\n";
   cout << "2. Sorting Benchmarks\n";

   do
   {
       int input;
       cout << "Please enter the program you would like to run. \n";
       cin >> input;
      
       if (input == 1)
       {
           const int ARRAY_SIZE = 20;
           int a = 0;
           int b = 0;
           int array[ARRAY_SIZE] = { 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20 };

           int data = 15;   //searching for 15

           //linear search
           for (int i = 0; i < 20; i++)
           {
               if (array[i] == data)
               {
                   a++;
                   break;
               }
               a++;
           }
           //binary
           int low = 0, high = 20 - 1, mid;

           while (low <= high)
               mid = (low + high + 1) / 2;
           if (array[mid] == data)
           {
               b++;
               break;
           }
           else if (array[mid] < data)
           {
               low = mid + 1;
           }
           else
           {
               high = mid - 1;
               b += 2;
           }
           cout << "Using Linear search: " << a << endl;
           cout << "Using Binary search: " << b << endl;
       }
       if (input == 2)
       {
           int exchangesInBubbleSort;
           int exchangesInSelectionSort;

           int array1[20] = { 3,14,15,16,2,7,18,6,5,8,20,4,19,2,12,9,11,10,1,17 };
           int array2[20] = { 3,14,15,16,2,7,18,6,5,8,20,4,19,2,12,9,11,10,1,17 };
          

           exchangesInBubbleSort = getExchangesInBubbleSort(array1, 20);

           cout << "The number of exchanges in bubble sort: " << exchangesInBubbleSort << endl;

           exchangesInSelectionSort = getExchangesInSelectionSort(array2, 20);

           cout << "The number of exchanges in selection sort: " << exchangesInSelectionSort << endl;
       }
       cout << "Would you like to run this program again?(Y/N)\n";
       cin >> choice;
   } while ((choice == 'y') || (choice == 'Y'));

   system("pause");
   return 0;
}

int getExchangesInBubbleSort(int intergers[], int n)
{
   int eCount = 0;
   bool isSwap;
   int current;

   do
   {
       //set the boolean value to false
       isSwap = false;

       for (int i = 0; i < (n - i); i++)
       {
           current = intergers[i];
           intergers[i] = intergers[i + 1];
           intergers[i + 1] = current;

           //set boolean value to true
           isSwap = true;
           {
               eCount++;
           }
       }
   } while (isSwap);

   return eCount;
}

int getExchangesInSelectionSort(int intergers[], int n)
{
   int eCount = 0;
   int smallestinterger;
   int smallestindex;

   for (int i = 0; i < (n - 1); i++)
   {
       smallestinterger = intergers[i];
       smallestindex = i;
       for (int j = (i + 1); j < n; j++)
       {
           if (intergers[j] < smallestinterger)
           {
               smallestinterger = intergers[j];
               smallestindex = j;

               eCount++;
           }
       }
       intergers[smallestindex] = intergers[i];
       intergers[i] = smallestinterger;
   }

   return eCount;
}

When it runs it allows the user to enter their menu choice, but after that it gives no output.

These are the errors it gives:

The thread 0x2288 has exited with code -1073741510 (0xc000013a).
The thread 0x4f24 has exited with code -1073741510 (0xc000013a).
The thread 0x334c has exited with code -1073741510 (0xc000013a).
The thread 0x26f0 has exited with code -1073741510 (0xc000013a).
The thread 0xcd0 has exited with code -1073741510 (0xc000013a).
The program '[15716] Lab6.exe' has exited with code -1073741510 (0xc000013a).

Answer 1

Code - I have made changes in the code , I have commented the changes that I did . Please have a look.

#include<iostream>

using namespace std;

//prototypes
int getExchangesInBubbleSort(int[], int);
int getExchangesInSelectionSort(int[], int);

int main()
{
char choice;
  

cout << "1. Search Benchmarks\n";
cout << "2. Sorting Benchmarks\n";

do
{
int input;
cout << "Please enter the program you would like to run. \n";
cin >> input;
  
if (input == 1)
{
const int ARRAY_SIZE = 20;
int a = 0;
int b = 0;
int array[ARRAY_SIZE] = { 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20 };

int data = 15; //searching for 15

//linear search
for (int i = 0; i < 20; i++)
{
if (array[i] == data)
{
a++;
break;
}
a++;
}
//binary
int low = 0, high = 20 - 1, mid;

/*here after while loop parantheses were missing , I have added those here*/
while (low <= high){
mid = (low + high + 1) / 2;
if (array[mid] == data)
{
b++;
break;
}
else if (array[mid] < data)
{
low = mid + 1;
}
else
{
high = mid - 1;
b += 2;
}
}
cout << "Using Linear search: " << a << endl;
cout << "Using Binary search: " << b << endl;
}
if (input == 2)
{
int exchangesInBubbleSort;
int exchangesInSelectionSort;

int array1[20] = { 3,14,15,16,2,7,18,6,5,8,20,4,19,2,12,9,11,10,1,17 };
int array2[20] = { 3,14,15,16,2,7,18,6,5,8,20,4,19,2,12,9,11,10,1,17 };
  

exchangesInBubbleSort = getExchangesInBubbleSort(array1, 20);

cout << "The number of exchanges in bubble sort: " << exchangesInBubbleSort << endl;

exchangesInSelectionSort = getExchangesInSelectionSort(array2, 20);

cout << "The number of exchanges in selection sort: " << exchangesInSelectionSort << endl;
}
cout << "Would you like to run this program again?(Y/N)\n";
cin >> choice;
} while ((choice == 'y') || (choice == 'Y'));

system("pause");
return 0;
}

int getExchangesInBubbleSort(int intergers[], int n)
{
int eCount = 0,j=0,i=0;
bool isSwap;
int current;

/* I have changed the functionality for bubble sort because the previous one was giving issue*/
for (i = 0; i < n; ++i)
   {
       for (j = 0; j < n-i-1; ++j)
       {
           // Comparing consecutive data and switching values if value at j > j+1.
           if (intergers[j] > intergers[j+1])
           {
               intergers[j] = intergers[j]+intergers[j+1];
               intergers[j+1] = intergers[j]-intergers[j + 1];
               intergers[j] = intergers[j]-intergers[j + 1];
               eCount++;
           }
       }
       // Value at n-i-1 will be maximum of all the values below this index.
   }  
return eCount;
}

int getExchangesInSelectionSort(int intergers[], int n)
{
int eCount = 0;
int smallestinterger;
int smallestindex;

for (int i = 0; i < (n - 1); i++)
{
smallestinterger = intergers[i];
smallestindex = i;
for (int j = (i + 1); j < n; j++)
{
if (intergers[j] < smallestinterger)
{
smallestinterger = intergers[j];
smallestindex = j;

eCount++;
}
}
intergers[smallestindex] = intergers[i];
intergers[i] = smallestinterger;
}

return eCount;
}

Screenshots -

Pls give thumbs up or hit like.