C program that deals with structures and arrays?

Lisa b

13y2.1kVisual Basic .NET

Set up a text file consisting of names and telephone numbers. Some example lines are provided below.

Note that each name ends with a semi-colon with no spaces around the semi-colon.

Key John;09-41783

Baggins Bilbo;05-89378

Write a C program that includes the following:

· A structure to store one name and one telephone number

· An array of these structures called phonelist

· The phonelist must be loaded from the file by using *exactly* this piece of code:

i = 0;

while (fgets(line, 200, f) != NULL) {

phonelist[i] = getdetails(line);

i++;

}

· At least three functions (including the function called getdetails)

The following menu must be displayed on the screen:

A. Search for a name

B. Display all names

Q. Quit

The program must perform the appropriate operations. If B is selected, the names must be shown in alphabetical order. Note that the names in the file are not in any particular order. should be easy to read

3 Replies

Know the answer? Post it — somebody with the same question will find it here.

Vulpes13y ago
Yes, you can always replace switch/case with an if/else ladder.

As I've used the toupper() function, you'll also need to include ctype.h if you're using gcc rather than VC.

Here's the revised program:

#include
#include
#include

struct contact
{
char name[180];
char phone[20];
};

struct contact getdetails(char line[])
{
struct contact person;
int i = 0, j = 0;

while (line[i] != ';')
{
person.name[i] = line[i];
i++;
}

person.name[i] = '\0';
i++;

while(line[i] != '\0')
{
person.phone[j] = line[i];
i++;
j++;
}

person.phone[j] = '\0';
return person;
}

char getchoice()
{
char choice;

printf("\nA. Search for a name");
printf("\n\nB. Display all names");
printf("\n\nC. Quit\n\n");

do
{
printf("Your choice A/B/C : ");
scanf("%c", &choice);
getchar();
choice = toupper(choice);
}
while(choice <'A' || choice > 'C');

return choice;
}

void sort_phonelist(struct contact phonelist[], int start, int n)
{
int i, j;
struct contact temp;

for(i = 1 + start; i < start + n; i++)
{
for(j = start + n - 1; j >= i; j--)
{
if(strcmp(phonelist[j - 1].name, phonelist[j].name) > 0)
{
temp = phonelist[j - 1];
phonelist[j - 1] = phonelist[j];
phonelist[j] = temp;
}
}
}
}

#define N 100 /* maximum number of entries in file, say */

int main()
{
int i, count, found;
char choice;
char line[200];
char searchname[180];
struct contact phonelist[N];
FILE *f;
f = fopen("phonelist.txt", "r");

i = 0;

while (fgets(line, 200, f) != NULL)
{
phonelist[i] = getdetails(line);
i++;
}

count = i;
fclose(f);

do
{
choice = getchoice();

sort_phonelist(phonelist, 0, count);

if (choice == 'A')
{
printf("\nEnter name to search for : ");
gets(searchname);
found = 0;

for(i = 0; i < count; i++)
{
if (!strcmp(phonelist[i].name, searchname))
{
printf("The phone number of %s is %s\n", phonelist[i].name, phonelist[i].phone);
found = 1;
break;
}
}

if(!found) printf("Unable to find that name in the phone list\n");
}
else if (choice == 'B')
{
printf("\n");

for(i = 0; i < count; i++)
{
printf("%s\n", phonelist[i].name);
}

}
}
while(choice != 'C');

return 0;
}
0
Lisa b13y ago
Is they way for doing the program without using "Switch" and "Case". how would we do that?
0
Vulpes13y ago
Try this:

#include
#include

struct contact
{
char name[180];
char phone[20];
};

struct contact getdetails(char line[])
{
struct contact person;
int i = 0, j = 0;

while (line[i] != ';')
{
person.name[i] = line[i];
i++;
}

person.name[i] = '\0';
i++;

while(line[i] != '\0')
{
person.phone[j] = line[i];
i++;
j++;
}

person.phone[j] = '\0';
return person;
}

char getchoice()
{
char choice;

printf("\nA. Search for a name");
printf("\n\nB. Display all names");
printf("\n\nC. Quit\n\n");

do
{
printf("Your choice A/B/C : ");
scanf("%c", &choice);
getchar();
choice = toupper(choice);
}
while(choice <'A' || choice > 'C');

return choice;
}

void sort_phonelist(struct contact phonelist[], int start, int n)
{
int i, j;
struct contact temp;

for(i = 1 + start; i < start + n; i++)
{
for(j = start + n - 1; j >= i; j--)
{
if(strcmp(phonelist[j - 1].name, phonelist[j].name) > 0)
{
temp = phonelist[j - 1];
phonelist[j - 1] = phonelist[j];
phonelist[j] = temp;
}
}
}
}

#define N 100 /* maximum number of entries in file, say */

int main()
{
int i, count, found;
char choice;
char line[200];
char searchname[180];
struct contact phonelist[N];
FILE *f;
f = fopen("phonelist.txt", "r");

i = 0;

while (fgets(line, 200, f) != NULL)
{
phonelist[i] = getdetails(line);
i++;
}

count = i;
fclose(f);

do
{
choice = getchoice();

sort_phonelist(phonelist, 0, count);

switch (choice)
{
case 'A':
printf("\nEnter name to search for : ");
gets(searchname);
found = 0;

for(i = 0; i < count; i++)
{
if (!strcmp(phonelist[i].name, searchname))
{
printf("The phone number of %s is %s\n", phonelist[i].name, phonelist[i].phone);
found = 1;
break;
}
}

if(!found) printf("Unable to find that name in the phone list\n");
break;

case 'B' :
printf("\n");

for(i = 0; i < count; i++)
{
printf("%s\n", phonelist[i].name);
}

break;

case 'C' :
break;
}
}
while(choice != 'C');

return 0;
}
0