Arduino程序实现插入排序法
📝示例代码:
byte a1=244;
byte e = 211;
int b = 200;
float c = 198.7;
static int a[] = {27, 36, 38, 44, 2, 3, 4, 5, 15, 19, 16, 46, 47, 48, 52};
int len = sizeof(a) / sizeof(int);
void setup() {
Serial.begin(115200);
Print(a, len);
}
void loop() {
InsertSort(a, len);
Print(a, len);
delay(8000);
}
void InsertSort(int a[], int n)
{
for (int i = 1; i < n; i++)
{
if (a[i] < a[i - 1])
{
int j = i - 1;
int x = a[i];
a[i] = a[i - 1];
while (x < a[j])
{
a[j + 1] = a[j];
j--;
}
a[j + 1] = x;
}
}
}
void Print(int a[], int len)
{
Serial.print("\t");
for (int j = 0; j < len; j++)
{
Serial.print(a[j]+String("-"));
}
Serial.println("");
}
- 📜串口输出结果:
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/7cad2a50842e75949988aeaa0487fc8d.png)