#include <stdio.h>
\n#include <stdlib.h>
\n#include <time.h><\/p>\n
typedef struct{
\nint a;
\nint b;
\nint c;
\n}TEST;<\/p>\n
int comp(const void*c1,const void*c2);<\/p>\n
int main(void)
\n{
\nint i;
\nTEST base[10];<\/p>\n
\/*\u4e71\u6570\u306e\u751f\u6210*\/
\nsrand((unsigned int)time(NULL));<\/p>\n
for(i = 0;i<10;i++){
\n base[i].a = rand() % 100; \/* 0\uff5e99\u306e\u4e71\u6570 *\/
\n base[i].b = rand() % 100;
\n base[i].c = rand() % 100;
\n printf( “%dt”, base[i].a );
\n printf( “%dt”, base[i].b );
\n printf( “%dt”, base[i].c );
\n printf( “n” );
\n }<\/p>\n
\/*TEST\u69cb\u9020\u4f53\u306eb\u3092\u57fa\u6e96\u306b\u30bd\u30fc\u30c8*\/
\nprintf(“n–TEST\u69cb\u9020\u4f53\u306eb\u3092\u57fa\u6e96\u306b\u30bd\u30fc\u30c8–nn”);
\nqsort(base,10, sizeof(TEST),comp);<\/p>\n
\/* \u30bd\u30fc\u30c8\u5f8c\u306e\u30c7\u30fc\u30bf\u3092\u8868\u793a*\/
\nfor(i=0;i<10;i++){
\n printf( “%dt”, base[i].a );
\n printf( “%dt”, base[i].b );
\n printf( “%dt”, base[i].c );
\n printf( “n” );
\n }<\/p>\n
return 0;
\n}<\/p>\n
\/* \u6bd4\u8f03\u95a2\u6570 *\/
\nint comp( const void *c1, const void *c2 )
\n{
\n TEST test1 = *(TEST *)c1;
\n TEST test2 = *(TEST *)c2;<\/p>\n
int tmp1 = test1.b; \/* b \u3092\u57fa\u6e96\u3068\u3059\u308b *\/
\n int tmp2 = test2.b;<\/p>\n
return tmp1 – tmp2;
\n}
\nC\u8a00\u8a9e \u30af\u30a4\u30c3\u30af\u30bd\u30fc\u30c8(\u914d\u5217\u8981\u7d20\u306e\u4e26\u3073\u66ff\u3048) – stdlib.h – [ qsort ] | \u52c7\u8e8d\u306e\u30b4\u30df\u7bb1
\nhttp:\/\/simd.jugem.jp\/?eid=114<\/p>\n","protected":false},"excerpt":{"rendered":"