c++冒泡排序

int a[] = {1,0,2,3};  int len = sizeof(a)/sizeof(a[0]);for(int i=0; i<=len-1; i++)  {  printf("%d ",a[i]);  } printf("\n");int i ,j ,change;for ( i = 0; i <= len -1; i++){change = 0;for ( j = len - 1 ; j > i; j--){if (a[j-1] > a[j]){int temp = a[j-1];a[j-1] = a[j];a[j] = temp;            change = 1;}  }if (change ==0){break;}}for(i=0; i<=len-1; i++)  {  printf("%d ",a[i]);  }