#include <iostream>
using namespace std;
template<typename T>
void Swap(T& a, T& b)
{
T tmp = a;
a = b;
b = tmp;
}
template<typename T>
void Printarr(T arr[], int len)
{
for (int i = 0; i < len; i++)
{
cout << arr[i] << " ";
}
cout << endl;
}
template<typename T>
void Sortarr(T arr[],int len)
{
for (int i = 0; i < len; i++)
{
int min_max = i;
for (int j = i + 1; j < len; j++)
{
if (arr[j] < arr[min_max])
{
min_max = j;
}
}
if (i != min_max)
{
Swap(arr[i], arr[min_max]);
}
}
}
void test1()
{
char char_arr[] = "asfddnvisuebkallhfdxzz";
int int_arr[] = { 12,563,5,2,30,0,54,15,1812,812,84,5,5,8,9,6,200 };
int char_size = sizeof(char_arr) / sizeof(char_arr[0]);
int int_size = sizeof(int_arr) / sizeof(int_arr[0]);
cout << "Pre_sorting: " << endl;
cout << "char_arr : ";
Printarr(char_arr, char_size);
cout << "int_arr : ";
Printarr(int_arr, int_size);
Sortarr(char_arr, char_size);
Sortarr(int_arr, int_size);
cout << "Post_sorting: " << endl;
cout << "char_arr : ";
Printarr(char_arr, char_size);
cout << "int_arr : ";
Printarr(int_arr, int_size);
}
int main()
{
test1();
system("pause");
return 0;
}