基于“冒泡排序&&选择排序&&插入排序”的代码

一、冒泡排序

#include<stdio.h>
int main()
{
	int a[10],i,j,t;
	printf("请输入10个数字:\n");
	for(i=0;i<10;i++)
		scanf("%d",&a[i]);
	printf("\n");
	for(j=0;j<9;j++){
		for(i=0;i<9-j;i++){
			if(a[i]>a[i+1]){t=a[i];a[i]=a[i+1];a[i+1]=t;}
		}
	}
	printf("这十个数字的顺序是:\n");
	for(i=0;i<10;i++)
		printf("%d\t",a[i]);
	printf("\n");
	return 0;
}

二、选择排序(两种版本)

#include<stdio.h>
int main()
{
	int a[]={2,42,432,1,435,5356,23,32523,3};
	int min,i,j,t;
	for(i=0;i<9;i++){
		min=i;
		for(j=i+1;j<9;j++){
			if(a[min]>a[j])
				min=j;
		}
		t=a[min];
		a[min]=a[i];
		a[i]=t;
	}
	printf("排序后的:\n");
	for(i=0;i<9;i++)
		printf("%d ",a[i]);
	return 0;
}
#include<stdio.h>
#define N 10
int main()
{
	int a[N]={0,3,21,4,5,2,54,34,655,76};
	int i,j,t,b,cnt;
	int max,e;
	cnt=N; 
	b=0;
	for(i=N-1;i>=0;i--){
		max=i;
		for(j=0;j<N-1-b;j++){
			if(a[max]<a[j])
			max=j;
		}
		t=a[max];
		a[max]=a[cnt-1];
		a[cnt-1]=t;
		cnt--;
//		for(e=0;e<N;e++)
//			printf("%d ",a[e]);
//		printf("\n");
//		printf("\n");
		b++;
	}
	for(e=0;e<N;e++)
		printf("%d ",a[e]);
	return 0;
}

三、插入排序

#include <stdio.h>
int main() 
{
	int a[]={23,3,1,42,4,2,345};
	int i,end,x;
	for(i=0;i<6;i++){
		int end=i;
		int x=a[end+1];
		while(end>=0){
			if(a[end]>x)
			{
				a[end + 1] = a[end];
				--end;
			}
			else break;
		}
		a[end+1]=x;
	}
	for(i=0;i<7;i++)
		printf("%d\t",a[i]);
	return 0;
}

/*                                                                          
 *          .,:,,,                                        .::,,,::.          
 *        .::::,,;;,                                  .,;;:,,....:i:         
 *        :i,.::::,;i:.      ....,,:::::::::,....   .;i:,.  ......;i.        
 *        :;..:::;::::i;,,:::;:,,,,,,,,,,..,.,,:::iri:. .,:irsr:,.;i.        
 *        ;;..,::::;;;;ri,,,.                    ..,,:;s1s1ssrr;,.;r,        
 *        :;. ,::;ii;:,     . ...................     .;iirri;;;,,;i,        
 *        ,i. .;ri:.   ... ............................  .,,:;:,,,;i:        
 *        :s,.;r:... ....................................... .::;::s;        
 *        ,1r::. .............,,,.,,:,,........................,;iir;        
 *        ,s;...........     ..::.,;:,,.          ...............,;1s        
 *       :i,..,.              .,:,,::,.          .......... .......;1,       
 *      ir,....:rrssr;:,       ,,.,::.     .r5S9989398G95hr;. ....,.:s,      
 *     ;r,..,s9855513XHAG3i   .,,,,,,,.  ,S931,.,,.;s;s&BHHA8s.,..,..:r:     
 *    :r;..rGGh,  :SAG;;G@BS:.,,,,,,,,,.r83:      hHH1sXMBHHHM3..,,,,.ir.    
 *   ,si,.1GS,   sBMAAX&MBMB5,,,,,,:,,.:&8       3@HXHBMBHBBH#X,.,,,,,,rr    
 *   ;1:,,SH:   .A@&&B#&8H#BS,,,,,,,,,.,5XS,     3@MHABM&59M#As..,,,,:,is,   
 *  .rr,,,;9&1   hBHHBB&8AMGr,,,,,,,,,,,:h&&9s;   r9&BMHBHMB9:  . .,,,,;ri.  
 *  :1:....:5&XSi;r8BMBHHA9r:,......,,,,:ii19GG88899XHHH&GSr.      ...,:rs.  
 *  ;s.     .:sS8G8GG889hi.        ....,,:;:,.:irssrriii:,.        ...,,i1,  
 *  ;1,         ..,....,,isssi;,        .,,.                      ....,.i1,  
 *  ;h:               i9HHBMBBHAX9:         .                     ...,,,rs,  
 *  ,1i..            :A#MBBBBMHB##s                             ....,,,;si.  
 *  .r1,..        ,..;3BMBBBHBB#Bh.     ..                    ....,,,,,i1;   
 *   :h;..       .,..;,1XBMMMMBXs,.,, .. :: ,.               ....,,,,,,ss.   
 *    ih: ..    .;;;, ;;:s58A3i,..    ,. ,.:,,.             ...,,,,,:,s1,    
 *    .s1,....   .,;sh,  ,iSAXs;.    ,.  ,,.i85            ...,,,,,,:i1;     
 *     .rh: ...     rXG9XBBM#M#MHAX3hss13&&HHXr         .....,,,,,,,ih;      
 *      .s5: .....    i598X&&A&AAAAAA&XG851r:       ........,,,,:,,sh;       
 *      . ihr, ...  .         ..                    ........,,,,,;11:.       
 *         ,s1i. ...  ..,,,..,,,.,,.,,.,..       ........,,.,,.;s5i.         
 *          .:s1r,......................       ..............;shs,           
 *          . .:shr:.  ....                 ..............,ishs.             
 *              .,issr;,... ...........................,is1s;.               
 *                 .,is1si;:,....................,:;ir1sr;,                  
 *                    ..:isssssrrii;::::::;;iirsssssr;:..                    
 *                         .,::iiirsssssssssrri;;:.                      
 */                         

  • 7
    点赞
  • 10
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值