Question

How can i make a counter for the number of exchanges made in the linear algorithm?? The binary counter works but the linear doesn't.

Here's my code.

#include <iostream>

using namespace std;

void selectionSort(int[], int, int& );
void showSelection(int[], int);
void sortArray(int[], int, int&);
void showArray(const int[], int);

int main()
{
   int values[25] = { 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24 };

   cout << "The values are \n";
   showArray(values, 25);

   int counter1 = 0, counter2 = 0;

   sortArray(values, 25, counter1);

   cout << "the sorted values are sorted with the bubble sort :\n";
   showArray(values, 25);
   cout << "Number of exhanges with bubble sort: " << counter1 << endl;

   selectionSort(values, 25, counter2);

   cout << "The other sorted values are sorted with selection sort : \n";
   showArray(values, 25);
   cout << " Number of exhanges by selection sort: " << counter2 << endl;

   return 0;

}

void sortArray(int array[], int size, int &e)
{
   bool swap;
   int temp;

   do {
       swap = false;
       for (int count = 0; count < (size - 1); count++)
       {
           if (array[count] < array[count + 1]   )
           {
               e++;
               temp = array[count];
               array[count] = array[count + 1];
               array[count + 1] = temp;
               swap = true;
       }
       }
   } while (swap);
}

void selectionSort(int array[], int size, int &e)
{
   int startScan, minindex, minValue;

   for (startScan = 0; startScan < (size - 1); startScan++)
   {
       minindex = startScan;
       minValue = array[startScan];
       for (int index = startScan + 1; index < size; index++)
       {
           if (array[index] < minValue)
           {
               minValue = array[index];
               minindex = index;
           }
       }
       array[minindex] = array[startScan];
       array[startScan] = minValue;
       e++;
   }
}

void showArray(const int array[], int size)
{
   for (int count = 0; count < size; count++)
       cout << array[count] << " " << endl;
}

Answer 1

Its working fine and giving output of how many times the values exchange in linear sort or bubble sort..

Here is code of yours:

#include <iostream>

using namespace std;

void selectionSort(int[], int, int &);

void showSelection(int[], int);

void sortArray(int[], int, int &);

void showArray(const int[], int);

int main()

{

int values[25] = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24};

cout << "The values are \n";

showArray(values, 25);

int counter1 = 0, counter2 = 0;

sortArray(values, 25, counter1);

cout << "the sorted values are sorted with the bubble sort :\n";

showArray(values, 25);

cout << "Number of exhanges with bubble sort: " << counter1 << endl;

selectionSort(values, 25, counter2);

cout << "The other sorted values are sorted with selection sort : \n";

showArray(values, 25);

cout << " Number of exhanges by selection sort: " << counter2 << endl;

return 0;

}

void sortArray(int array[], int size, int &e)

{

bool swap;

int temp;

do

{

swap = false;

for (int count = 0; count < (size - 1); count++)

{

if (array[count] < array[count + 1])

{

e++;

temp = array[count];

array[count] = array[count + 1];

array[count + 1] = temp;

swap = true;

}

}

} while (swap);

}

void selectionSort(int array[], int size, int &e)

{

int startScan, minindex, minValue;

for (startScan = 0; startScan < (size - 1); startScan++)

{

minindex = startScan;

minValue = array[startScan];

for (int index = startScan + 1; index < size; index++)

{

if (array[index] < minValue)

{

minValue = array[index];

minindex = index;

}

}

array[minindex] = array[startScan];

array[startScan] = minValue;

e++;

}

}

void showArray(const int array[], int size)

{

for (int count = 0; count < size; count++)

cout << array[count] << " " << endl;

}

Output:

The values are 1 7 9 11 15 17 19 21 25 2 16 12 14 28 22 24 the sorted values are sorted with the bubble sort : 24 23 22 19 18 17 16 13 12 11 2 Number of exhanges with bubble sort: 222 The other sorted values are sorted with selection sort 1 18 11 12 15 16 17 18 19 21 22 23 Number of exhanges by selection sort: 24 A9E09E8...