冒泡排序、选择排序、插入排序代码

最新推荐文章于 2024-10-05 15:09:26 发布

原创最新推荐文章于 2024-10-05 15:09:26 发布 · 369 阅读

0 ·

CC 4.0 BY-SA版权

c语言常用的三种排序方法专栏收录该内容

1 篇文章

订阅专栏

本文介绍了三种基本的排序算法：插入排序、冒泡排序和选择排序，并提供了每种算法的C语言实现示例。通过这些示例，读者可以了解排序算法的基本原理及其实现过程。

#include <stdio.h>
#include <stdlib.h>

void insertsort ()
{
   int temp =0, i, j;
   int arr[7] = {1,2,3,5,6,7};
   printf ("please input a number:\n");
   scanf ("%d",&temp);
   for (i = 0; i < 6; i++)
   {
       if (temp < arr[i])
       {
           break;
       }
   }
   printf ("%d\n",i);
   for (j = 5; j > i - 1; j--)
   {
       arr[j+1] = arr[j];
   }
   arr[i] = temp;
   printf ("%d\n",j);
   for (i = 0; i < 6; i++)
   {
       printf ("arr[i] = %d\n",arr[i]);
   }
}

void bubblesort ()
{
   int i, j, arr[6];
   printf ("please input six number:\n");
   for (i = 0; i < 6; i++)
   {
       scanf ("%d",&arr[i]);
   }
   for (i = 0; i < 5; i++)
   {
       for (j = 0; j < 6 - i; j++)
       {
           if (arr[j] > arr[j+1])
           {
               int temp = arr[j];
               arr[j] = arr[j+1];
               arr[j+1] = temp;
           }
       }
   }
   for (i = 0; i < 6; i++)
   {
       printf ("arr[%d] = %d\n",i, arr[i]);
   }
}

void selectsort ()
{
   int i, j, m = 0, arr[6];
   printf ("please input six number:\n");
   for (i = 0; i < 6; i++)
   {
       scanf ("%d",&arr[i]);
   }
   for (i = 0; i < 5; i++)
   {
       for (j = i + 1; j < 6; j++)
       {
           if (arr[i] > arr[j])
           {
               int temp = arr[i];
               arr[i] = arr[j];
               arr[j] = temp;
               m++;
           }
       }
   }
   for (i = 0; i < 6; i++)
           {
               printf ("arr[%d] = %d\n", i, arr[i]);
           }
   printf ("m = %d\n",m);
}

int main(void)
{
   //insertsort ();
   bubblesort ();
   //selectsort ();
   return 0;
}