|
%d,%d= %ld\n",m, n, result);
printf("Duration: %4.3f micro sec.\n\n",
(double)(endTime.QuadPart-startTime.QuadPart)/freq.QuadPart*1000000);
}
else printf("This computer don't support QueryPerformanceCounter Set\n");
} 3주 - Basic Recursion
|
|
|
|
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#define LOOP 10
#define MAX 1000
int list[MAX], sorted[MAX];
int count;
void merge_sort(int list[], int n);
void merge_pass(int list[], int sorted[], int n, int s);
void merge(int list[
|
|
|
|
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define LOOP 10
#define MAX 1000
int data[MAX];
int e, n, count, index;
int selection_sort(int data[], int n);
int bin_srch(int data[], int k);
int inter_srch(int data[], int k);
void main() {
int i
|
|
|
|
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>
#define LOOP 10
#define MAX 1000
int list1[MAX], list2[MAX];
int n, count, left, right;
int selection_sort(int list1[], int n);
void quicksort(int list2[], int left, int right);
void
|
|
|
|
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define LOOP 10
#define MAX 1000
typedef struct{
int key;
int link;
}element;
element list[MAX];
int count;
int rmerge(element list[], int lower, int upper);
int listmerge(element list[], int
|
|
메뉴펼치기
