- The program needs to order the structures from least to greatest based on the zip element of each individual struct.
- The input is based on input/output redirection. An example of an input.txt file is as follows:
程序需要根据每个结构的zip元素从最小到最大排序结构。
输入基于输入/输出重定向。 input.txt文件的示例如下:
Jason Solis 20294 Lorenzana Dr Woodland Hills, CA 91364 Robert Smith 19831 Henshaw St Culver City, CA 94023 Bob Arum 5142 Dumont Pl Azusa, CA 91112
code:
struct info {
char name[BUFF_SIZE];
char stAddress[BUFF_SIZE];
char cityAndState[BUFF_SIZE];
char zip[BUFF_SIZE];
};
void selectionSort(struct info *ptrStruct);
int main(void)
{
int count;
char buffer[600];
struct info *ptrStruct[512];
for (count = 0; count < 18; count++)
{
ptrStruct[count] = (struct info*) malloc(sizeof(struct info));
gets(buffer);
strcpy(ptrStruct[count]->name, buffer);
gets(buffer);
strcpy(ptrStruct[count]->stAddress, buffer);
gets(buffer);
strcpy(ptrStruct[count]->cityAndState, buffer);
gets(buffer);
strcpy(ptrStruct[count]->zip, buffer);
}
selectionSort(ptrStruct);
printf("\n\nLEAST TO GREATEST\n");
for (count = 0; count < 18; count++)
{
printf("%s\n", ptrStruct[count]->name);
printf("%s\n", ptrStruct[count]->stAddress);
printf("%s\n", ptrStruct[count]->cityAndState);
printf("%s\n", ptrStruct[count]->zip);
}
}
void selectionSort(struct info *ptrStruct[])
{
int count2;
int count1;
int minIndex;
struct info *ptrTemporary;
for (count2 = 0; count2 < 18 - 1; count2++)
{
minIndex = count2;
for (count1 = count2 + 1; count1 < 18; count1++)
{
if (strcmp(ptrStruct[count1]->zip, ptrStruct[minIndex]->zip) < 0)
minIndex = count1;
}
ptrTemporary = ptrStruct[count2];
ptrStruct[count2] = ptrStruct[minIndex];
ptrStruct[minIndex] = ptrTemporary;
}
}
1 个解决方案
#1
1
fix like this
像这样解决
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define BUFF_SIZE 32
#define STRUCT_SIZE 512
struct info {
char name[BUFF_SIZE];
char stAddress[BUFF_SIZE];
char cityAndState[BUFF_SIZE];
char zip[BUFF_SIZE];
};
void selectionSort(struct info *ptrStruct[], int size);//!
int main(void){
int count, size;//!
char buffer[600];
struct info *ptrStruct[STRUCT_SIZE];
for (count = 0; count < STRUCT_SIZE; count++){
ptrStruct[count] = (struct info*) malloc(sizeof(struct info));
if(EOF==scanf("%599[^\n]%*c", buffer)){//!
free(ptrStruct[count]);
break;
};
strcpy(ptrStruct[count]->name, buffer);
scanf("%599[^\n]%*c", buffer);
strcpy(ptrStruct[count]->stAddress, buffer);
scanf("%599[^\n]%*c", buffer);
strcpy(ptrStruct[count]->cityAndState, buffer);
scanf("%599[^\n]%*c", buffer);
strcpy(ptrStruct[count]->zip, buffer);
}
size = count;//!
selectionSort(ptrStruct, size);//!
printf("\n\nLEAST TO GREATEST\n");
for (count = 0; count < size; count++)//!
{
printf("%s\n", ptrStruct[count]->name);
printf("%s\n", ptrStruct[count]->stAddress);
printf("%s\n", ptrStruct[count]->cityAndState);
printf("%s\n", ptrStruct[count]->zip);
free(ptrStruct[count]);
}
}
void selectionSort(struct info *ptrStruct[], int size)//!
{
int count1, count2;
int minIndex;
struct info *ptrTemporary;
for (count2 = 0; count2 < size -1; count2++)//!
{
minIndex = count2;
for (count1 = count2 + 1; count1 < size; count1++)//!
{
if (strcmp(ptrStruct[count1]->zip, ptrStruct[minIndex]->zip) < 0)//!
minIndex = count1;
}
if(minIndex != count2){
ptrTemporary = ptrStruct[count2];//!
ptrStruct[count2] = ptrStruct[minIndex];
ptrStruct[minIndex] = ptrTemporary;//!
}
}
}
#1
1
fix like this
像这样解决
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define BUFF_SIZE 32
#define STRUCT_SIZE 512
struct info {
char name[BUFF_SIZE];
char stAddress[BUFF_SIZE];
char cityAndState[BUFF_SIZE];
char zip[BUFF_SIZE];
};
void selectionSort(struct info *ptrStruct[], int size);//!
int main(void){
int count, size;//!
char buffer[600];
struct info *ptrStruct[STRUCT_SIZE];
for (count = 0; count < STRUCT_SIZE; count++){
ptrStruct[count] = (struct info*) malloc(sizeof(struct info));
if(EOF==scanf("%599[^\n]%*c", buffer)){//!
free(ptrStruct[count]);
break;
};
strcpy(ptrStruct[count]->name, buffer);
scanf("%599[^\n]%*c", buffer);
strcpy(ptrStruct[count]->stAddress, buffer);
scanf("%599[^\n]%*c", buffer);
strcpy(ptrStruct[count]->cityAndState, buffer);
scanf("%599[^\n]%*c", buffer);
strcpy(ptrStruct[count]->zip, buffer);
}
size = count;//!
selectionSort(ptrStruct, size);//!
printf("\n\nLEAST TO GREATEST\n");
for (count = 0; count < size; count++)//!
{
printf("%s\n", ptrStruct[count]->name);
printf("%s\n", ptrStruct[count]->stAddress);
printf("%s\n", ptrStruct[count]->cityAndState);
printf("%s\n", ptrStruct[count]->zip);
free(ptrStruct[count]);
}
}
void selectionSort(struct info *ptrStruct[], int size)//!
{
int count1, count2;
int minIndex;
struct info *ptrTemporary;
for (count2 = 0; count2 < size -1; count2++)//!
{
minIndex = count2;
for (count1 = count2 + 1; count1 < size; count1++)//!
{
if (strcmp(ptrStruct[count1]->zip, ptrStruct[minIndex]->zip) < 0)//!
minIndex = count1;
}
if(minIndex != count2){
ptrTemporary = ptrStruct[count2];//!
ptrStruct[count2] = ptrStruct[minIndex];
ptrStruct[minIndex] = ptrTemporary;//!
}
}
}