Selection sort algorithm using pointer arithmetic

Question

I need to sort elements of array in ascending order using selection sort algorithm and pointer arithmetic.

That means the following (using pointer arithmetic):

• find the minimum element in unsorted array;
• swap the found minimum element with the first element
• repeat it until the end of array
• print sorted array

Code:

#include <stdio.h>
void swap(double **pp, double **qq) {
  double *temp = *pp;
  *pp = *qq;
  *qq = temp;
}
void sortArray(double arr[], int n) {
  double *q, *min;
  q = min = arr;
  while (min > arr + n) {
    while (q < arr + n) {
      if (*q < *min) 
        min = q;
        q++;
      }
      min++;
      swap(&min, &q);
  }
}
void writeSorted(double arr[], int n) {
  double *qq = arr;
  while (qq < arr + n) {
    printf("%g ", *qq);
    qq++;
  }
}
int main() {
  double arr[4] = {2.1, 4.23, 3.67, 1.5};
  int n = 4;
  sortArray(arr, n);
  writeSorted(arr, n);
  return 0;
}

This code prints the same unsorted array. Do you know how to fix it?