Implement the three simple sorting algorithms namely selecti

Implement the three simple sorting algorithms namely selection, insertion and bubble sorts.

Each function should take an integer array as input and output a sorted array.

NOTE: The code should be in \"C LANGUAGE\".

Thankyou.

Solution

Selrction short for {9, 4, 5, 3, 2, 8, 4, 1}

#include <iostream>

using namespace std;
void selectionSort(int a[], int size);
void print(const int a[], int iMin, int iMax);
int main() {
const int SIZE = 8;
int a[SIZE] = {9, 4, 5, 3, 2, 8, 4, 1};
print(a, 0, SIZE - 1);
cout << endl;
selectionSort(a, SIZE);
print(a, 0, SIZE - 1);
cout << endl;
}
void selectionSort(int a[], int size) {
int temp; // for swaping
for (int i = 0; i < size - 1; ++i) {
print(a, 0, i - 1);
print(a, i, size - 1);
int minIndex = i;
for (int j = i + 1; j < size; ++j) {
if (a[j] < a[minIndex]) minIndex = j;
}
if (minIndex != i) { // swap
temp = a[i];
a[i] = a[minIndex];
a[minIndex] = temp;
}
cout << \"=> \";
print(a, 0, i - 1);
print(a, i, size - 1);
cout << endl;
}
}
void print(const int a[], int iMin, int iMax) {
cout << \"{\";
for (int i = iMin; i <= iMax; ++i) {
cout << a[i];
if (i < iMax) cout << \",\";
}
cout << \"} \";
}