C语言 奇偶排序算法详解及实例代码

// Completed on 2014.10.8 12:05
// Language: C99
//
// 版权所有（C）codingwu  (mail: oskernel@126.com) 
// 博客地址：http://www.cnblogs.com/archimedes/

#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h> 
void swap(int *a, int *b)
{
  int t;
  t = *a;
  *a = *b;
  *b = t;
}
void printArray(int a[], int count)
{
  int i;
  for(i = 0; i < count; i++)
    printf("%d ",a[i]);
  printf("\n");
}
void Odd_even_sort(int a[], int size) 
{
  bool sorted = false;
  while(!sorted)
  {
    sorted = true;
    for(int i = 1; i < size - 1; i += 2)
    {
      if(a[i] > a[i + 1])
      {
        swap(&a[i], &a[i + 1]);
        sorted = false;
      }
    }
    for(int i = 0; i < size - 1; i += 2)
    {
      if(a[i] > a[i + 1])
      {
        swap(&a[i], &a[i+1]);
        sorted = false;
      }
    }
  }
}
int main(void)  
{
  int a[] = {3, 5, 1, 6, 9, 7, 8, 0, 11};
  int n = sizeof(a) / sizeof(*a);
  Odd_even_sort(a, n);
  printArray(a, n);
  return 0;
}