Question

You must use C Language.

The Main Objective: Make the first and last name ALL CAPITALS even if the user types in lower case letters. Lastly, flip the first name and last name around. So: HEIDI, HATFIELD to HATFIELD, HEIDI. (PLEASE uppercase all the letters)

End Goal:

HATFIELD, HEIDI
KAISER, RUSSELL
LIPSHUTZ, HOWARD
PENKERT, DAWN
WRIGHT, ELIZABETH

Please use this reference below, to fix the code given. Code given is below, I want the user to be able to enter the first name and last name lowercased, be able to have them capitalized, and have the last name first and the first name last if that makes sense. So not: heidi, hatfield but HATFIELD, HEIDI. I'm aware you can type it in capitalized, but that's more work on the users end and not what is required of the program.

This is what the code prints now:

heidi, hatfield

russel, kaiser

howard, lipshutz

dawn, penkert

elizabeth, wright

CODE:

#include
#include
#include

void stsrt(char *strings[], int num);
char * s_gets(char * st, int n);

#define LIMIT 20
#define FIRST_SIZE 25
#define LAST_SIZE 25

void rollsheet(void);
char * s_gets(char * st, int n);
void stsrt(char *strings[], int num);

int roll(void) {
printf("Enter up to %d student names, and I will sort them!\n", LIMIT);
printf("To stop, press the Enter key at a line's start.\n\n");
rollsheet();
}

void rollsheet(void) {
int ct = 0;
char *ptstr[LIMIT];
char firstName[LIMIT][FIRST_SIZE];
char lastName[LIMIT][LAST_SIZE];
int k;

while (ct < LIMIT)
{
printf("\nEnter the First name: ");
if (s_gets(firstName[ct], FIRST_SIZE) != NULL && firstName[ct][0] != '\0')
{
printf("Enter the Last name: ");
if (s_gets(lastName[ct], LAST_SIZE) != NULL && lastName[ct][0] != '\0')
{

strcat(firstName[ct], ", ");
strcat(firstName[ct], lastName[ct]);
ptstr[ct] = firstName[ct];
}
else
break;
}
else
break;
ct++;
}

stsrt(ptstr,ct);
puts("\nHere's the sorted list:\n");
for (k = 0; k < ct; k++)
puts(ptstr[k]);
}

void stsrt(char *strings[], int num)
{
char *temp;
int top, seek;

for (top = 0; top < num-1; top++)
for (seek = top + 1; seek < num; seek++)
if (strcmp(strings[top],strings[seek]) > 0)
{
temp = strings[top];
strings[top] = strings[seek];
strings[seek] = temp;
}
}

char * s_gets(char * st, int n)
{
char * ret_val;
int i = 0;

ret_val = fgets(st, n, stdin);
if (ret_val)
{
while (st[i] != '\n' && st[i] != '\0')
i++;
if (st[i] == '\n') {
st[i] = '\0';
}
else {
while (getchar() != '\n')
continue;
}
}
return ret_val;
}

Answer 1

#include <stdio.h>
#include <string.h>
#include <conio.h>
int main()
{
roll();
}

void stsrt(char *strings[], int num);
char * s_gets(char * st, int n);

#define LIMIT 20
#define FIRST_SIZE 25
#define LAST_SIZE 25

void rollsheet(void);
char * s_gets(char * st, int n);
void stsrt(char *strings[], int num);

int roll(void) {
printf("Enter up to %d student names, and I will sort them!\n", LIMIT);
printf("To stop, press the Enter key at a line's start.\n\n");
rollsheet();
}

void rollsheet(void) {
int ct = 0;
char *ptstr[LIMIT];
char firstName[LIMIT][FIRST_SIZE];
char lastName[LIMIT][LAST_SIZE];
char tenp[LIMIT][LAST_SIZE];
int k;

while (ct < LIMIT)
{
printf("\nEnter the First name: ");
if (s_gets(firstName[ct], FIRST_SIZE) != NULL && firstName[ct][0] != '\0')
{
printf("Enter the Last name: ");
if (s_gets(lastName[ct], LAST_SIZE) != NULL && lastName[ct][0] != '\0')
{

strcat(toupper(lastName[ct]), ", ");
strcat(toupper(lastName[ct]), toupper(firstName[ct]));
ptstr[ct] = lastName[ct];
}
else
break;
}
else
break;
ct++;
}

stsrt(ptstr,ct);
puts("\nHere's the sorted list:\n");
for (k = 0; k < ct; k++)
puts(ptstr[k]);
}

void stsrt(char *strings[], int num)
{
char *temp;
int top, seek;

for (top = 0; top < num-1; top++)
for (seek = top + 1; seek < num; seek++)
if (strcmp(strings[top],strings[seek]) > 0)
{
temp = strings[top];
strings[top] = strings[seek];
strings[seek] = temp;
}
}

char * s_gets(char * st, int n)
{
char * ret_val;
int i = 0;

ret_val = fgets(st, n, stdin);
if (ret_val)
{
while (st[i] != '\n' && st[i] != '\0')
i++;
if (st[i] == '\n') {
st[i] = '\0';
}
else {
while (getchar() != '\n')
continue;
}
}
return ret_val;
}