asked on

Sorting an array of structs

Hi all,
I was having problem in sorting the array. Currently I'm trying to build the index array in memory, sort it(using insertion sort and sort according to the country code) and then write the whole sorted array(country code with offset) into a file.

This is what I have so far:

#include	<stdio.h>
#include 	<string.h>
#include 	<stdlib.h>
#include 	"ourhdr.h"

typedef struct				// Country Data struct declaration
    	{  	
		char code[4]; 		// Country Code 
       		char name[50];		// Country Name
		float life_expectancy;	// Life Expentancy of the Country's citizen
		int pop;		// Country's Population
    	} DATATYPE;

typedef struct				// Index Data struct declaration
	{
		char code[4];		
		long int offset;	// offset of the data
	} INDEX;

INDEX StructArray[300];
DATATYPE ActualStruct; // for a single struct

void sort(INDEX SortArray[], int n)
{
	int k, j;
	char **temp;
	for (k=2;k<n;k++)
	{
		temp = SortArray[k].code;
		for (j=k-1;j>=0; j++)
		{
			if(strcmp(SortArray[j].code, temp) > 0)
			{
			SortArray[j+1].code = SortArray[j].code;
			}
		}
		SortArray[j+1].code = temp;
	}
}

int main() 
{ 

	//int m, size;
	int i = 0;
	int size=0;
	FILE *FI, *FO, *FO2;
	char Line[1000];  // NO input line (delimited by \n) is longer than 1000

	char * Tok;         // token from line
	if((FI = fopen("AllCountries1.txt", "r")) == NULL) // open a stream from "countries"
    		err_sys("Open Fail\n");

	if((FO = fopen("DATABASE.txt", "wb")) == NULL) // open a stream from "countries"
    		err_sys("Open DATABASE Fail\n");

	if((FO2 = fopen("DIRECTORY.txt", "w+")) == NULL) // open a stream from "countries"
    		err_sys("Open DIRECTORY Fail\n");

    while ( fgets( (char *) Line,1000,FI) != NULL) // fill buffer up to newline or eof or error
    {

	Tok = strtok( Line ,",\n"); 	// skip ID number

        Tok = strtok( NULL ,",\n"); 	// this should get the country code 
        ActualStruct.code[0] = Tok[0];
        ActualStruct.code[1] = Tok[1];
        ActualStruct.code[2] = Tok[2];
        ActualStruct.code[3] = 0; 	// To create "string" 

	Tok = strtok( NULL ,",\n"); 	// this should get the country name 
        strncpy(&ActualStruct.name[0],Tok,50);	// copy string at most 50 chars

	Tok = strtok( NULL ,",\n"); 	// skip
	Tok = strtok( NULL ,",\n"); 	// skip 
	Tok = strtok( NULL ,",\n"); 	// skip
	Tok = strtok( NULL ,",\n"); 	// skip 

	Tok = strtok( NULL ,",\n"); 	// this should get the population
	ActualStruct.pop = atoi(Tok);	// convert string to integer

        Tok = strtok( NULL ,",\n"); 	// this one should get life expectancy
        ActualStruct.life_expectancy = atof(Tok);	// convert string to a floating point number

	strcpy(StructArray[i].code, ActualStruct.code);                  // get the current code 
	StructArray[i].offset = ftell(FO);                               // get the current offset in the DATABASE file 

	if (fwrite(&ActualStruct, sizeof(DATATYPE),1,FO) != 1)  // write the struct to the DATABASE file 
		err_sys("fwrite error");

	printf("%5s%50s%15u%18f%10u\n",&ActualStruct.code[0],&ActualStruct.name[0],ActualStruct.pop,ActualStruct.life_expectancy,StructArray[i].offset);
	
	i++;
	}
	
	printf("Before Sort:\n");
	for (i=0; i<size; i++)
	{
		printf("%s \t %u\n",StructArray[i].code, StructArray[i].offset);
	}	
	sort(StructArray,size);
	printf("After Sort:\n");
	for (i=0; i<size; i++)
	{	
	printf("%s \t %u\n",StructArray[i].code, StructArray[i].offset);
	}
	
	if (fclose(FI))				// close file descriptor FI
		err_sys("Close error\n");	
	if (fclose(FO))				// close file descriptor FO
		err_sys("Close error\n");	
	if (fclose(FO2))			// close file descriptor FO2
		err_sys("Close error\n");

    	printf(" Made the break \n");  // and this if not error :) 

}

Open in new window

however I'm getting these error:
test1.c: In function `sort':
test1.c:88: warning: assignment from incompatible pointer type
test1.c:91: warning: passing arg 2 of `strcmp' from incompatible pointer type
test1.c:93: error: incompatible types in assignment
test1.c:96: error: incompatible types in assignment

Thanks in advance.

ASKER CERTIFIED SOLUTION