#include <iostream>
// A function to implement the sorting
template <typename T, std::size_t S>
void doSomething(T (&arr)[S])
{
int i, j;
int n = S;
for (i = 0; i < n - 1; i++) {
for (j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
std::swap(arr[j], arr[j + 1]);
}
}
}
return;
}
// Function to print an array
void printArray(int *arr, int size)
{
int i;
for (i = 0; i < size; i++)
std::cout << "i=" << i << " " << arr[i] << " ";
std::cout << std::endl;
}
// Driver code
int main()
{
int arr[] = { 5, 1, 4, 2, 8};
int N = sizeof(arr) / sizeof(arr[0]);
doSomething(arr);
std::cout << "Sorted Original array: \n";
printArray(arr, N);
return 0;
}
