Toggle menu
Toggle personal menu
Not logged in
Your IP address will be publicly visible if you make any edits.

데블스캠프2010/일반리스트: Difference between revisions

From ZeroWiki
imported>beonit
No edit summary
imported>beonit
No edit summary
Line 1: Line 1:
* http://isis.poly.edu/kulesh/stuff/src/klist/
* http://isis.poly.edu/kulesh/stuff/src/klist/
  #include <unistd.h>  
  // #include <unistd.h>  
  #include <stdio.h>  
  #include <stdio.h>  
  #include <stdlib.h>  
  #include <stdlib.h>  
Line 19: Line 19:
    
    
   a = (int *)malloc(sizeof(int)*MAX);  
   a = (int *)malloc(sizeof(int)*MAX);  
  clock_t stime, etime;  
//  clock_t stime, etime;  
    
    
   for (i = 0; i < MAX; i++)  
   for (i = 0; i < MAX; i++)  
   {  
   {  
     a[i] = random()%MAX;  
     a[i] = rand()%MAX;  
   }  
   }  
    
    
  stime = clock();  
//  stime = clock();  
   qsort( a, MAX, sizeof(int), fn_qsort_intcmp );  
   qsort( a, MAX, sizeof(int), fn_qsort_intcmp );  
  etime = clock();  
//  etime = clock();  
  printf("Time : %.3fs\n",(double)(etime - stime)/CLOCKS_PER_SEC);  
//  printf("Time : %.3fs\n",(double)(etime - stime)/CLOCKS_PER_SEC);  
   return 0;  
   return 0;  
  }
  }



Revision as of 13:03, 22 June 2010

// #include <unistd.h> 
#include <stdio.h> 
#include <stdlib.h> 
#include <time.h> 
 
#define MAX 1000000 
 
int fn_qsort_intcmp( const void *a, const void *b ) 
{ 
  return( *(int *)a - *(int *)b); 
} 
 
int main() 
{ 
  int *a; 
  int i; 
  int *c; 
 
  a = (int *)malloc(sizeof(int)*MAX); 
//  clock_t stime, etime; 
 
  for (i = 0; i < MAX; i++) 
  { 
    a[i] = rand()%MAX; 
  } 
 
//  stime = clock(); 
  qsort( a, MAX, sizeof(int), fn_qsort_intcmp ); 
//  etime = clock(); 
//  printf("Time : %.3fs\n",(double)(etime - stime)/CLOCKS_PER_SEC); 
  return 0; 
}