C language sorting (simple selection sorting and bubble sorting)

C language sorting (simple selection sorting and bubble sorting)

1. Simple selection sort

• Both i and j are used as subscript indexes for sorting

#include <stdio.h>
//简单选择排序法
int main()
{
    
    
	int array[]={
    
    12,33,9,8,99,88,77,66};
	int lenSize=sizeof(array)/sizeof(array[0]);
	int temp;
	
	for(int i=0;i<lenSize-1;i++)
	{
    
    
		printf("第%d次循环\n",i);
		for(int j=i+1;j<lenSize;j++)
		{
    
    
		//从小到大
			if(array[i]>array[j])
			{
    
    
				temp=array[i];
				array[i]=array[j];
				array[j]=temp;
			}
		/*从大到小	
		   if(array[i]<array[j])
			{
				temp=array[i];
				array[i]=array[j];
				array[j]=temp;
			}*/
		}
		
	}
	for(int k;k<lenSize;k++)
	{
    
    
		printf("%d ",array[k]);
	}
	return(0);
}

2. Bubble sort

• i is used as a newline, and i is used to sort the subscript index

#include <stdio.h>
//冒泡排序法
int main()
{
    
    
	int array[]={
    
    12,33,9,8,99,88,77,66};
	int lenSize=sizeof(array)/sizeof(array[0]);
	int temp;
	
	for(int i=0;i<lenSize-1;i++)
	{
    
    
		printf("第%d次循环\n",i);
		for(int j=0;j<lenSize-1-i;j++)
		{
    
    
			if(array[j]>array[j+1])
			{
    
    
				temp=array[j];
				array[j]=array[j+1];
				array[j+1]=temp;
			}
			
		}
		
	}
	
	for(int k;k<lenSize;k++)
	{
    
    
		printf("%d ",array[k]);
	}
	return(0);
}