How to perform insertion sort for array with more than one variable?

[AkiraC]

Hi, I have an array with more than one variable, eg: ID, name, gender etc. And I want to perform sorting for the data in the binary file, so I decided to use insertion sort. Here's the code:

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#pragma warning(disable : 4996)

void addMember();
void sortMember();

struct Date { int day, month, year; };
struct Member { char memberId[6], name[40], gender, IC[15], contactNum[15]; struct Date DOB; } members;

FILE* fPtr;

main() {

	int choice;

	do {
		printf("\nMember Management System\n");
		printf("-------------------------\n");
		printf("1. Add members info\n");
		printf("2. Sort members info\n");
		printf("0. Exit\n");
		printf("Select an option:> ");
		scanf("%d", &choice);

		switch (choice) {
		case 1:
			addMember();
			break;
		case 2:
			sortMember();
			break;
		}
	} while (choice != 0);

	printf("Bye Bye!\n");

	system("pause");
}

void printMemberBanner(void)
{
	printf("\nMember Details\n");
	printf("------------------------------------------------------------------------------------------------------------------------------------------------\n");
	printf("Member ID\tName\t\t\t\tGender\t\tIC\t\t\tContact Number\t\tDate of Birth\n");
	printf("------------------------------------------------------------------------------------------------------------------------------------------------\n");
}

void addMember() {

	printf("\nAdd Member Details\n");
	printf("--------------------\n");
	fPtr = fopen("member.bin", "ab");

	if (fPtr == NULL) {
		printf("Failed to open file");
		exit(-1);
	}

	char ansAdd;

	do {
		printf("\nEnter your member ID: ");
		rewind(stdin);
		scanf("%[^\n]", &members.memberId);
		
		printf("Enter your name: ");
		rewind(stdin);
		scanf("%[^\n]", &members.name);
		
		printf("Enter your gender: ");
		rewind(stdin);
		scanf("%c", &members.gender);
		
		printf("Enter your IC: ");
		rewind(stdin);
		scanf("%[^\n]", &members.IC);
		
		printf("Enter your contact number: ");
		rewind(stdin);
		scanf("%[^\n]", &members.contactNum);

		printf("Enter your date of birth(dd/mm/yyyy): ");
		rewind(stdin);
		scanf("%d %d %d", &members.DOB.day, &members.DOB.month, &members.DOB.year);

		fwrite(&members, sizeof(members), 1, fPtr);

		printMemberBanner();
		printf("%-6s\t\t%-10s\t\t\t%c\t\t%-15s\t\t%-15s\t\t%02d/%02d/%02d\n", members.memberId, members.name, members.gender, members.IC, members.contactNum, members.DOB.day, members.DOB.month, members.DOB.year);

		printf("\nDo you want to continue adding? (Y/N) ");
		rewind(stdin);
		scanf("%c", &ansAdd);
		ansAdd = toupper(ansAdd);

	} while (ansAdd == 'Y');

	fclose(fPtr);

void sortMember() {
	struct Member p[20];

	printf("\nSort Member Details\n");
	printf("--------------------\n");
	fPtr = fopen("member.bin", "rb");

	if (fPtr == NULL) {
		printf("Failed to open file");
		exit(-9);
	}

	int i = 0, numRecords = 0;

	while (fread(&p[i], sizeof(members), 1, fPtr) != 0) {
		i++;
		numRecords++;
	}

	char key[20];
	//this method is insertion sort 

	for (int step = 1; step < numRecords; step++) {
		strcpy(key, p[step].memberId); //copy the ID into key
		int j = step - 1;

		while (strcmp(key, p[j].memberId) < 0 && j >= 0) { //compare key with each element on the left of it until an element smaller than the key is found
			strcpy(p[j + 1].memberId, p[j].memberId);
			strcpy(p[j + 1].name, p[j].name);
			p[j + 1].gender = p[j].gender;
			strcpy(p[j + 1].IC, p[j].IC);
			strcpy(p[j + 1].contactNum, p[j].contactNum);
			p[j + 1].DOB.day = p[j].DOB.day;
			p[j + 1].DOB.month = p[j].DOB.month;
			p[j + 1].DOB.year = p[j].DOB.year;
			--j;
		}

		strcpy(p[j + 1].memberId, key); //Place key at after the element just smaller than it
		
	}

	fclose(fPtr);

	fPtr = fopen("member.bin", "wb");

	if (fPtr == NULL) {

		printf("Unable to open the file\n");
		exit(-7); //exit program
	}

	printMemberBanner();

	for (int i = 0; i < numRecords; i++) {
		fwrite(&p[i], sizeof(p[i]), 1, fPtr);
		printf("%-6s\t\t%-10s\t\t\t%c\t\t%-15s\t\t%-15s\t\t%02d/%02d/%02d\n", p[i].memberId, p[i].name, p[i].gender, p[i].IC, p[i].contactNum, p[i].DOB.day, p[i].DOB.month, p[i].DOB.year);
	}

	fclose(fPtr);

}

I want to sort the member ID, from M0001 to M9999, and the function will sort the member ID, name, gender etc in a proper order, but I can only sort the member ID, any help is appreciated, I search on the Internet but the code is only for the array with one variable

Here's the data
[Output]
Member Details
----------------------------------------------------------------------------------------------------------------------
Member ID Name Gender IC Contact Number Date of Birth
----------------------------------------------------------------------------------------------------------------------
M0001 Lim Weng Kee F 010101-01-0001 011-111 1111 01/01/2001
M0403 Chin Ting Wei F 020202-02-0002 012-222 2222 02/02/2002
M2002 Ang Boon Ching M 030303-03-0003 013-333 3333 03/03/2003
[/output]
There are 3 data here, but they are not in a proper order.

[thmm]

Is there a reason why you don't use qsort ?

[salem c]

There's something oddly familiar about that code....

Mmm, interesting...
https://www.cplusplus.com/forum/beginner/282279/

Right down to the broken use of rewind(stdin)

> strcpy(p[j + 1].memberId, p[j].memberId);
1. You're not swapping records properly.
2. You're doing it the long way to begin with.

It's simply

struct Member temp;
temp = p[i];
p[i] = p[j];
p[j] = temp;