Arduino之希尔排序法

Posted 2021-05-17 perseverance52

Arduino之希尔排序法

采用Arduino IDE编译环境

采用Arduino nano开发板

byte a1=244;
byte e = 211;
int b = 200;
float c = 198.7;
static  int arr[] = {27, 36, 38, 44, 2, 3, 4, 5, 15, 19, 16, 46, 47, 48, 52};
int len = sizeof(arr) / sizeof(int); //计算数组中的成员数
  
void setup() {
//  int max,cout;

  Serial.begin(115200);
//if ((int)b > (int)c){ Serial.println(b);}
//if(a1 < e){Serial.println(e);}
//max = a1 > e ? e : a1;Serial.println(max);
//cout = (b++,b--,160+b);Serial.println(cout);
//if(10&&5){Serial.println(5,DEC);}Serial.println(10,DEC);

   Print(arr, len);//数组原始序列
 
}

void loop() {
  ShellSort(arr, len);
  Print(arr, len);
  delay(8000);

}

void ShellSort(int arr[], int len)
{
  int temp, i, j;
  for (int d = len / 2; d > 0; d = d / 2)
  { //将元素分组，d间距
    for (i = d; i < len; i++)
    {
      temp = arr[i];
      for (j = i - d; j >= 0 && temp < arr[j]; j = j - d)
      { //对分组成员进行比较
        arr[j + d] = arr[j];
      }
      arr[j + d] = temp;
    }
  }
}
void Print(int *arr, int len)
{
  Serial.print("\\t");
  for (int i = 0; i < len; i++)
  {
    Serial.print(arr[i]+String("-"));
  }
 Serial.println("");
}

串口输出结果：