#include <stdio.h>
// 冒泡法之相邻比较排序
void sort2(char array[], int len)
{
for (int i = 0; i < len - 1; i++)
{
for (int j = i+1 ; j < len ; j++)
{
if (array[i] > array[j])
{
char temp;
temp = array[i];
array[i] = array[j];
array[j] = temp;
}
}
}
}
int main(int argc, const char * argv[])
{
// insert code here...
printf("Hello, World!\n");
char arr2[] = "iPhone";
sort2(arr2, 6);
printf("%s",arr2);
return 0;
}