Bubble sort with no swap detection

bubblesort.c

int *bubbleSort(int *array, int count) {

  int unsorted = count; // number of unsorted elements in array
  bool swapped = false;

  while(unsorted > 1) {
    swapped = false;
    for(int i = 0; i < unsorted-1; i++) {
      if(array[i] > array[i+1]) {
        // swap
        int temp = array[i+1];
        array[i+1] = array[i];
        array[i] = temp;
        swapped = true; // need another iteration
      }
    }

    if(swapped == false) { // no swaps, dont need next iteration
      break;
    }

    unsorted--;
  }
}