六月五日作业

最新推荐文章于 2024-09-13 16:27:15 发布

qq_53892035

最新推荐文章于 2024-09-13 16:27:15 发布

阅读量120

点赞数 2

文章标签：算法排序算法数据结构

本文链接：https://blog.csdn.net/qq_53892035/article/details/139483768

版权

 #include "./head.h"                                                                             
                                                                                                 
 //insert sort                                                                                   
 void Inseert_Sort(int arr[],int number)                                                         
 {                                                                                               
     int i = 0, j = 0;                                                                           
     for(i = 2; i < number; i++)                                                                 
     {                                                                                           
         arr[0] = arr[i];                                                                        
         for(j = i-1; arr[j] > arr[0]; j--)                                                      
             arr[j+1] = arr[j];                                                                  
         arr[j+1] = arr[0];                                                                      
     }                                                                                           
     return;                                                                                     
 }                                                                                               
                                                                                                 
                                                                                                 
 //bubble sort                                                                                   
 void Bubble_Sort(int arr[], int number)                                                         
 {                                                                                               
     int i = 0, j = 0, foat = 0;                                                                 
     for(i = 0; i < number -1; i++)                                                              
     {                                                                                           
         foat = 0;                                                                               
         for(j = 0; j < number-1-i; j++)                                                         
         {                                                                                       
             if(arr[j] > arr[j+1])                                                               
             {                                                                                   
                 arr[j] += arr[j+1];                                                             
                 arr[j+1]= arr[j] - arr[j+1];                                                    
                 arr[j] -= arr[j+1];                                                             
                 foat = 1;                                                                       
             }                                                                                   
                                                                                                 
         }                                                                                       
         if(0 == foat)                                                                           
             return;                                                                             
     }                                                                                           
     return;                                                                                     
 }                                                                                               
                                                                                                 
                                                                                                 
 //select sort                                                                                   
 void Select_Sort(int arr[], int number)                                                         
 {                                                                                               
     int i = 0, j = 0 , temp = 0, min = 0;                                                       
     for(i = 0; i < number-1; i++)                                                               
     {                                                                                           
         min = i;                                                                                
         for(j = i+1; j < number; j++)                                                           
             if(arr[j] < arr[min])                                                               
                 min = j;                                                                        
         if(min != i)                                                                            
         {                                                                                       
             temp = arr[i];                                                                      
             arr[i] = arr[min];                                                                  
             arr[min] = temp;                                                                    
         }                                                                                       
     }                                                                                           
     return;                                                                                     
 }                                                                                               
                                                                                                 
                                                                                                 
                                                                                                 
 int partition(int arr[], int low, int high)                                                     
 {                                                                                               
     int pivote = arr[low];                                                                      
     while(low < high)                                                                           
     {                                                                                           
         while(arr[high] >= pivote && low < high)                                                
             high--;                                                                             
         arr[low] = arr[high];                                                                   
         low++;                                                                                  
         while(arr[low] < pivote && low <= high)                                                 
             low++;                                                                              
         arr[high] = arr[low];                                                                   
         high--;                                                                                 
                                                                                                 
     }                                                                                           
     return low;                                                                                 
 }                                                                                               
                                                                                                 
                                                                                                 
                                                                                                 
 //quick sort                                                                                    
 void Quick_Sort(int arr[], int low, int high)                                                   
 {                                                                                               
     if(low < high)                                                                              
     {                                                                                           
         int pos = partition(arr, low, high);                                                    
         Quick_Sort(arr, low, pos-1);                                                            
         Quick_Sort(arr, pos+1, high);                                                           
     }                                                                                           
     return;                                                                                     
 }

 #include <stdio.h>
 #include <stdlib.h>
 
 #define MAX 6
 
 
 /*
  * function:    insert sort
  * @param [ in] 
  * @param [out] 
  * @return      
  */
 void Inseert_Sort(int arr[],int number);
 
 
 /*
  * function:    bubble sort
  * @param [ in] 
  * @param [out] 
  * @return      
  */
 void Bubble_Sort(int arr[], int number);
 
 /*                                                                     
  * function:    select sort
  * @param [ in] 
  * @param [out] 
  * @return      
  */
 void Select_Sort(int arr[], int number);
 
 /*
  * function:    quick sort
  * @param [ in] 
  * @param [out] 
  * @return      
  */
 void Quick_Sort(int arr[], int low, int high);