冒泡排序、选择排序、插入排序代码
2016-07-27 21:06
239 查看
#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;
}
#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;
}
相关文章推荐
- yii2中sphinx搜索 多条件选择搜索
- poj1213Fantasy of a Summation(找规律,优化代码)
- JAVA学习随笔(6)--FileInputStream随笔
- 用Mac终端编写,编译C程序的实例
- python(五) 对数组排序
- Spring 中的单元测试
- K折交叉验证-python
- [kuangbin带你飞]专题十四 数论基础-C - Aladdin and the Flying Carpet
- Python用csv写入文件---消除空余行的技巧
- python打印文档字符串
- java日历源码
- 在IIS中访问APS页面时提示:“最可能的原因使用的托管的处理程序,但是未安装或未完整安装asp.net“
- 最小二乘法 多项式曲线拟合 原理公式理解 Python 实现
- 简单点,switch-case的结构简单点~ C语言学习(4)
- 《Java困惑》:多并发情况下HashMap是否还会产生死循环
- SpringAOP配置事物
- SpringMVC处理文件上传配置
- Python SyntaxError: Non-ASCII character '\xe5'编码错误
- java web-1:走进java web
- Myeclipse黑色主题配置