#include <stdio.h>
#include <stdlib.h>

unsigned count=0;

int comp(int n1,int n2)
{
    count++;
    return n1<n2?1:(n1>n2?-1:0);
}

void mysort(int *src,int *ret,unsigned lc)
{
    unsigned n,i,j,l;

    if(lc==1) ret[0]=src[0];
    else if(lc==2) {
        if(comp(src[0],src[1])<0) {
            ret[0]=src[1];
            ret[1]=src[0];
        } else {
            ret[0]=src[0];
            ret[1]=src[1];
        }
    } else if(lc) {
        n=lc/2;
        mysort(src,ret,n);
        mysort(src+n,ret+n,lc-n);
        for(i=0;i<lc;i++) src[i]=ret[i];
        for(i=0,j=0,l=0;i<n&&j<lc-n;) {
            if(comp(src[i],src[j+n])<0) ret[l++]=src[(j++)+n];
            else ret[l++]=src[i++];
        }
        while(i<n) ret[l++]=src[i++];
        while(j<lc-n) ret[l++]=src[(j++)+n];
    }
}

#define RLSS 20

int main(void)
{
    int rls[RLSS],rlst[RLSS],i;

    srand(time(NULL));
    for(i=0;i<RLSS;i++) rls[i]=rand()%256;
    printf("乱数列:\n");
    for(i=0;i<RLSS;i++) printf("%d: %d\n",i,rls[i]);
    mysort(rls,rlst,RLSS);
    printf("\nソート結果:\n");
    for(i=0;i<RLSS;i++) printf("%d: %d\n",i,rlst[i]);
    printf("\n比較回数=%d\n",count);
    return 0;
}

#include <stdio.h>
#include <stdlib.h>
#include<time.h>

#define KOMA 40
#define KAMOKUSUU 33

int a[KOMA],i,j,hojo;

main(){ 

    srand(time(NULL));

    /* 乱数の発生*/
    for(i = 0;i < KOMA;i++) {
        a[i] = i;
    } 
    for(i = 0;i < KOMA;i++){
        j =rand()%40;
        hojo = a[i];
        a[i] = a[j];
        a[j] = hojo;
    }
    printf("コマ番号\n　");
    for(i = 0;i < KAMOKUSUU;i++){ 
        printf("%d ",a[i]);
    }
    printf("\n");



    /*乱数の並び替え*/ 
    for(i=0;i<KOMA;i++){
        for(j=i+1;j<KOMA;j++){
            if(a[i]>a[j]){
                hojo = a[i];
                a[i] = a[j];
                a[j] = hojo;
            }
        }
    }
    printf("コマ番号\n　");
    for(i = 0;i < KAMOKUSUU;i++){ 
        printf("%d ",a[i]);
    }
    printf("\n");
    return 0;
}