We help IT Professionals succeed at work.

We've partnered with Certified Experts, Carl Webster and Richard Faulkner, to bring you two Citrix podcasts. Learn about 2020 trends and get answers to your biggest Citrix questions!Listen Now

x

structure

jennifer032497
on
Medium Priority
290 Views
Last Modified: 2010-04-15
Write a program that uses the qsort() function to sort an array of structures of type PRODUCT.Each product record has the following fields :-
Product category(string)
Product code(int)
Description(string)
Unit Cost(float)
quantity(long int)
The array is to be sorted in alphabetical order according to the product category.In situation where there are similar product category, then the records involved should be sorted according to product code in ascending order.
Comment
Watch Question

This is obviously a homework assignment. Which parts do you need help on?

Author

Commented:
Below is what i have worked on. Please help me to debug.

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define SIZE 10

typedef struct
{
  char *category;
  int code;
  char *desc;
  float cost;
  long quantity;
}PRODUCT;

int str_cmp ();
int code_cmp ();

main ()
{
  PRODUCT record [SIZE];
  int x, num;
  clrscr();
  printf("Enter number of record [ max 10 ] : ");
  scanf("%d",&num);
  clrscr();
  printf("DATA ENTRY\n");
  printf("==========\n\n");
  for (x=0; x<num; x++)
  {
    printf("Product Category : ");
    scanf("%s",record[x].category);
    printf("\nProduct Code     : ");
    scanf("%d",&record[x].code);
    printf("\nDescription      : ");
    scanf("%s",record[x].desc);
    printf("\nUnit Cost        : ");
    scanf("%f",&record[x].cost);
    printf("\nQuantity         : ");
    scanf("%ld",&record[x].quantity);
    printf("\n\n=========================");
    printf("============================\n\n");
  }
  qsort(record,num,sizeof(PRODUCT),str_cmp);
  qsort(record,num,sizeof(PRODUCT),code_cmp);
  clrscr();
  gotoxy(20, 0);
  printf("SORTED RECORD\n");
  gotoxy(20, 1);
  printf("*************\n\n");
  printf("Category\tCode\tDescription\tCost\tQty\n");
  printf("=================================");
  printf("===================\n");
  for(x=0; x<num; x++)
  {
    printf("%s\t%d\t%s\t%f\t%d\n",record[x].category,
      record[x].code,record[x].desc,record[x].cost,
      record[x].quantity);
  }
  getch();
}

int str_cmp(PRODUCT *p1,PRODUCT *p2)
{
  return(strcmp(p1->category,p2->category));
}

int code_cmp(PRODUCT *n1,PRODUCT *n2)
{
  return(n1->code-n2->code);
}

It all boils down to the comparison function, used by the
qsort() routine. Here's an example:

int comp(const void* a, const void* b) {

const product* pa= a; /* use product* for convenience *.
const product* pb= b;

int r; /* comparison result */

r= strcmp(pa->category, pb->category);

if (r) /* categories are different */
   return r;

/* compare codes if categories compare equal */
if (pa->code > pb->code)
   return 1;

if (pa->code < pb->code)
   return -1;

return 0;

}

kind regards,

Jos aka jos@and.nl

Not the solution you were looking for? Getting a personalized solution is easy.

Ask the Experts

Author

Commented:
Thank you Jos for your help.But my main problem is when entering the records of the product. Please consider this point.
Ah, but that's not what you asked for (see your original
question above).

Hint: have a look at e.g. the category member: it's
a pointer to a character (string), but it doesn't point
to anything (same for the 'description' member).

kind regards,

Jos aka jos@and.nl
Access more of Experts Exchange with a free account
Thanks for using Experts Exchange.

Create a free account to continue.

Limited access with a free account allows you to:

  • View three pieces of content (articles, solutions, posts, and videos)
  • Ask the experts questions (counted toward content limit)
  • Customize your dashboard and profile

*This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

OR

Please enter a first name

Please enter a last name

8+ characters (letters, numbers, and a symbol)

By clicking, you agree to the Terms of Use and Privacy Policy.