Sakurai/ClangStudy
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

code: code clean

Browse Source
This commit is contained in:
kemasama 2022-04-26 19:03:03 +09:00
parent 00f061fa5b
commit 511de8b71f
2 changed files with 11 additions and 26 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
quick_sort/quick_sort
View File

Binary file not shown.

37
quick_sort/quick_sort.c
View File

@ -70,21 +70,16 @@ int right // 右端（※配列の要素数ではない）
int
main()
{
/*
int array[] = {
10, 20, 30, 50,
50, 10, 45, 65,
76, 54, 56, 15,
34, 31, 14, 17,
14, 15, 11, 16,
90, 19, 98, 76,
75, 15, 161, 165,
166, 167, 87, 86
};
*/
int i;
int j;
int c;
int length = 0;
int read_line_size = 512;
char read_line[read_line_size];
FILE *fp;
char dataFile[] = "data.txt";
FILE *fp = fopen(dataFile, "r");
fp = fopen(dataFile, "r");
if ( fp == NULL ) {
printf("file can not open.\n");
@ -92,25 +87,19 @@ main()
}
fseek(fp, 0, SEEK_SET);
int line_count = 0;
int c;
while ( (c = fgetc(fp)) != EOF )
{
if ( c == '\n')
{
line_count++;
length++;
}
}
int array[line_count];
int array[length];
fseek(fp, 0, SEEK_SET);
int read_line_size = 512;
char read_line[read_line_size];
int j;
for ( j = 0 ; j < line_count ; j++ )
for ( j = 0 ; j < length ; j++ )
{
fgets(read_line, read_line_size, fp);
array[j] = atoi(read_line);
@ -118,13 +107,9 @@ main()
fclose(fp);
int length = sizeof(array) / sizeof(int);
printf("Length: %d\n", length);
quick_sort(array, 0, length - 1);
int i ;
for ( i = 0 ; i < length ; i++ )
{
printf("%d", array[i]);