地精排序-Gnome Sort

KingITech

于 2016-11-25 19:03:07 发布

阅读量471

点赞数 1

分类专栏：数据结构文章标签： c语言排序

本文链接：https://blog.youkuaiyun.com/qq_32931825/article/details/53338955

版权

数据结构专栏收录该内容

4 篇文章

订阅专栏

1.if i==0,we should straightly i++;
2.else if it’s ordered until a[i],we should i++ to skip
3.if it is unordered until a[i],we should swap,and then Roll back to i-1 to rejudge

c语言


#include<stdio.h>
void gnomesort(int a[],int n)
{
    int i = 0;
    while (i < n)
        if (i == 0 || a[i-1] <= a[i]) i++;
        else
        {
            int tmp = a[i];
            a[i] = a[i-1];
            a[--i] = tmp;
        }
}
int main()
{
    int a[5]= {7,4,1,3,2};
    gnomesort(a,5);
    for(int i=0; i<5; i++)printf("%d ",a[i]);
}