CODEWITHSUNDEEP
arrayscsorting
trehugger2000
trehugger2000

Reputation: 3

C programming: Function using pointers to sort array

I'm having some problems with this function. Its main purpose is to sorts the array of classes(below) in descending order by the number of sections. Here is the array of classes:

CIS_CLASSES *pCls, *pLast;
CIS_CLASSES  clsList[NUM_CLS] =
{
    {"CIS 35A", 2, {61, 63}},
    {"CIS 35B", 1, {62}},
    {"CIS 41A", 3, {1, 2, 61}},
    {"CIS 28",  1, {61}},
    {"CIS 22C", 4, {3, 4, 61, 63}},
    {"CIS 26B", 1, {61}},
    {"CIS 22B", 8, {1, 2, 3, 4, 6, 61, 62, 63}},
    {"CIS 29",  1, {61}},
    {"CIS 22A", 8, {1, 3, 5, 6, 7, 8, 61, 63}},
};

I've also defined NUM_CLS using struct:

#define NUM_CLS 9

typedef struct
{
    char  course[10];
    int   noSections;
    int   sections[16];
    int final;
} CIS_CLASSES;`

Here is the function :

void sortDescend(CIS_CLASSES  list[], CIS_CLASSES *pLast);
{
    CIS_CLASSES *pCurr;
    CIS_CLASSES *pWalk;

    for (pCurr = list- 1; pCurr < pLast; pCurr++)
    {
        CIS_CLASSES temp = *pCurr;
        pWalk = pCurr - 1;
        while (pWalk >= 0 && temp.final > pLast->list[pWalk].final)
        {
            pLast->list[pWalk + 1] = pLast->list[pWalk];
            pWalk--;
        }
        pLast->list[pWalk + 1] = temp;
    }
  }
}

When I try to run this code I get the error message: no member named 'list' in 'CIS_CLASSES'. But I don't understand why? and How can I make it run? Please let me know if I'm missing anything!

Upvotes: 0

Views: 83

Answers (3)

Dong0321
Dong0321

Reputation: 121

Please try to do as the following.

void sortDescend(CIS_CLASSES  pInput[], CIS_CLASSES **pOutput);
{
    // pOutput should be declared in your main function as the following
    // CIS_CLASSES **pOutput = (CIS_CLASSES **)malloc(NUM_CLS * sizeof(PVOID));

    // copy pointer arrays of CIS_CLASSES list elements
    for(int i=0; i<NUM_CLS; i++)
    {
        pOutput[i] = &pInput[i];
    }

    // bubble sort
    for (int i=0; i<NUM_CLS-1, i++)
    {
        for (int j=i+1; j<NUM_CLS; j++)
        {
            CIS_CLASSES temp = *pCurr;
            if(pOutput[i]->noSection < pOutput[j]->noSection)
            {
                pCurr = pOutput[i];
                pOutput[i] = pOutput[j];
                pOutput[j] = pCurr;
            }
        }
    }
    // You can access the descending sorted list item like pOutput[index]->course, ... 
}

Upvotes: 0

trehugger2000
trehugger2000

Reputation: 3

Thanks All! I updated my code to this :

    void sortDescend(CIS_CLASSES  list[], CIS_CLASSES *pLast);

{

CIS_CLASSES *pCurr;
 CIS_CLASSES *pWalk;

for (pCurr = list+1; pCurr < pLast; pCurr++)
{
    CIS_CLASSES temp = *pCurr;
    pWalk = pCurr - 1;
    while (pWalk >= 0 && strcmp(temp.course, pWalk->course) > 0)
   {
         *(pWalk + 1) = *pWalk;
          pWalk--;
   }
   *(pWalk + 1)  = temp;
}

} }

Upvotes: 0

John440
John440

Reputation: 85

Looking at your structure I don't see an element list there:

typedef struct
{
    char  course[10];
    int   noSections;
    int   sections[16];
    int final;
} CIS_CLASSES;

Therefore

pLast->list[pWalk].final

must fail.

Upvotes: 2

Related Questions