[자료구조]Iterative Merge sort, Recursive Merge sort, Heap sort 문제 + 소스코드

소개글

"[자료구조]Iterative Merge sort, Recursive Merge sort, Heap sort 문제 + 소스코드"에 대한 내용입니다.

목차

없음

본문내용

#include <stdio.h>
#define MAX_SIZE 100

typedef struct {
int key;
}element;

void merge(element initList[], element mergedList[], int i, int m, int n);
void mergePass(element initList[], element mergedList[], int n, int s);
void mergeSort(element a[], int n);

int main()
{
FILE *f;

element data[MAX_SIZE];
int size;
fopen_s(&f, "input.txt", "r");
printf("<<<<<<<<<< input List >>>>>>>>>>\n");
fscanf(f, "%d", &size);
for (int i = 1; !feof(f); i++)
{
fscanf(f, "%d", &data[i].key);
printf("%d ", data[i].key);
}
puts("\n");
fclose(f);

printf("<<<<<<<<<< executing iterative merge sort >>>>>>>>>>\n");
mergeSort(data, size);

printf("<<<<<<<<<< input List >>>>>>>>>>\n");
for (int i = 1; i <= size; i++)
printf("%3d ", data[i].key);
puts("\n");

return 0;
}

void merge(element initList[], element mergedList[], int i, int m, int n)
{
int j, k, t;
j = m + 1;
k = i;

while (i <= m && j <= n)

참고 자료

없음