复杂度小的排序

#include <stdio.h>

int main(int argc, char** argv){
    
    
    
    int arr01[5]={1,6,7,8,9};
    int arr02[5]={2,4,6,7,12};
    
    
    int arr03[10];
    int ia=0;
    int ib=0;
    int ic=0;
    
    
    while(ia<5&&ib<5)
   {
       
       if(arr01[ia]<=arr02[ib])
       {
           
           arr03[ic]=arr01[ia];
           ic++;ia++;
       }
       
       
       else
       {
           
           arr03[ic]=arr02[ib];
           ic++;ib++;
           
       }
       
       
       
       
   } 
    
    
    
    while(ia<5){
        
        arr03[ic++]=arr01[ia++];
        
        
    }
    
    
    while(ib<5){
        
        
        arr03[ic]=arr02[ib];
        
        ic++;
        ib++;
    }
    
    
    for(int i = 0;i < 10;i++) {
        printf("%d",arr03[i]);
    }
    
    
    
    
    return 0;
  }