void selectsort(int arr[], int n)
{
int index, i, j;
for (i = 0; i < n - 1; i++) {
index = i;
for (j = i + 1; j < n; j++) {
if(arr[index] > arr[j])
{
index = j;
}
}
if(index != i)
{
arr[i] ^= arr[index];
arr[index] ^= arr[i];
arr[i] ^= arr[index];
}
}
}
void popsort(int arr[], int n)
{
int i, j, flag;
for (i = 0; i < n - 1; i++) {
flag = 0;
for (j = 0; j < n - i - 1; j++) {
if(arr[j] > arr[j + 1])
{
arr[j] ^= arr[j + 1];
arr[j + 1] ^= arr[j];
arr[j] ^= arr[j + 1];
flag = 1;
}
}
if(flag = 0)
break;
}
}