Arduino之插入排序法

Posted 2021-05-21 perseverance52

Arduino之插入排序法

• 采用Arduino IDE编译环境
• 采用Arduino nano开发板

程序代码：

static int arr[] = {27, 36, 38, 44, 2, 3, 4, 5, 15, 19, 16, 46, 47, 48, 52};
 int len = sizeof(arr) / sizeof(int); //计算数组中的成员数
 static unsigned int count =0; 
void setup() {
  Serial.begin(115200);
  // 打印数据
  //Serial.println(size);
    Serial.print("排序前数组：");
 Print(arr, len);
  
}

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

}

void insertionSort(int *arr, int len)
{
  int i, j, tmp;

  for (i = 1; i < len - 1; i++)
  {
    tmp = arr[i]; //从未排序的队列，拿出一个
    j = i - 1;
    for (; j >= 0 && arr[j] > tmp; j--)
    {
      arr[j + 1] = arr[j];
      count++;
    }
    arr[j + 1] = tmp;
  }
}
void Print(int *arr, int len)
{
  for (int i = 0; i < len; i++)
  {
    Serial.print(arr[i]+String("-"));
  }
  Serial.println(String("排序次数：")+count);
}

• 串口打印信息
  

调整if条件判断，结果同上

static int arr[] = {27, 36, 38, 44, 2, 3, 4, 5, 15, 19, 16, 46, 47, 48, 52};
 int len = sizeof(arr) / sizeof(int); //计算数组中的成员数
 static unsigned int count =0; 
void setup() {
  Serial.begin(115200);
  // 打印数据
  //Serial.println(size);
    Serial.print("排序前数组：");
 Print(arr, len);
  
}

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

}

void insertionSort(int *arr, int len)
{
  int i, j, tmp;
  for (i = 1; i < len - 1; i++)
  {
    tmp = arr[i]; //从未排序的队列，拿出一个
    j = i - 1;
    for (; j >= 0 ; j--)
    {
      if(arr[j] > tmp){
      arr[j + 1] = arr[j];count++;}else{break;//有序的就跳过
      }
    }
    arr[j + 1] = tmp;
  }
}
void Print(int *arr, int len)
{
  for (int i = 0; i < len; i++)
  {
    Serial.print(arr[i]+String("-"));
  }
  Serial.println(String("排序次数：")+count);
}