|
list[], int n,int key_pos);
: 힙정렬 함수
5) void merge(SCORE list[], SCORE sorted[], int i, int m, int n,int key_pos);
: 병합정렬 보조함수
6) void merge_sort(SCORE list[], int n,int key_pos);
: 병합정렬 함수
7) void merge_pass(SCORE list[], SCORE sorted[], int n, int length,int key_pos);
:병합정
|
|
|
#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[
|
|
|
sort=0&res_fr=0&res_to=0&merge=0&start=1&a=pho_l&f=nx&r=1&u=http%3A%2F%2Fcafe.naver.com%2F941104%2F274
>
<http://imagesearch.naver.com/search.naver?where=idetail&query=%C7%C1%B6%FB%BD%BA%B4%EB%C7%F5%B8%ED&from=image&ac=-1&sort=0&res_fr=0&res_to=0&merge=0&start=3&a=pho_l&f=tab&r=3&u=http%3A%2F%
|
|
|
sort=0&res_fr=0&res_to=0&merge=0&start=43&a=pho_l&f=tab&r=13&u=http%3A%2F%2Fblog.naver.com%2Fbottero%3FRedirect%3DLog%26logNo%3D90019555742
- http://blog.naver.com/bottero?Redirect=Log&logNo=90019555742
- http://blog.daum.net/doldu/11761834?nil_profile=blog
- http://imagesearch.naver.com/search.nave
|
|
|
소트 처음 시작 시간 구함
merge_sort(insert_data,nArray[h]);
end = GetTickCount();//소트 끝난 시간 구함
end = end-start;//소트한 시간 구함
sum += end;//소트시간 누적
}
a= sum/10;//누적 시간을 실행 횟수로 나누어 줌
sum=0;
if( a < 50)
{
gotoxy(50-a,y);
putchar(16);
y += 6;
|
|
메뉴펼치기
