Thread: can anyone help me?

Sooo, you expect someone to make this for you and just hand it over?

Policy on this forum is that the user should attempt their homework before asking for help.

Please try to do it yourself, and if you have any questions, feel free to ask for help.

We will not do it for you, as that will not help you in the long run.

Good luck!

Code:

#include <iostream> 
#include <fstream> 
#include <iomanip> 
#include <string> 
 
using namespace std; 
 
void getdata(char name[], double &gpa) 
 
    { 
 
        cout << "Enter students name: "; 
 
        cin >> name;   
 
        cout << "Enter GPA: "; 
 
        cin >> gpa; 
 
    }//end getdata 
class nodeType 
 
    { 
    public: 
 
        string name;         
 
        double gpa; 
 
        nodeType *next;         
 
    }; 
 
int main() 
 
{ 
 
 
 
    nodeType *prior, *duo, *uno, *currentNode, *head; 
 
    char theName[4]; 
 
    double theGpa; 
 
    theGpa = 0.0; 
 
    for (int theList=1; theList<=2; theList++) 
 
    { 
 
        getdata(theName,theGpa); 
 
        currentNode = new nodeType; 
 
        currentNode->name = string(theName); 
 
        currentNode->gpa = theGpa; 
 
        currentNode->next = NULL; 
 
        head = currentNode; 
 
        prior = head; 
 
        for (int i=2;i<=10;i++) 
 
        { 
 
            getdata(theName,theGpa);     
 
            currentNode = new nodeType; 
 
            currentNode->name = string(theName); 
 
            currentNode->gpa = theGpa; 
 
        //sorting the list 
 
       if (currentNode->gpa > head->gpa)  
       { 
              currentNode->next = head; 
              head = currentNode; 
       } 
       else  
       { 
            prior = head; 
       
        while ((prior->next != NULL) && (prior->gpa) > (currentNode->gpa)) 
        { 
            if((prior->next->gpa)<(currentNode->gpa)) 
            { 
                currentNode->next = prior->next; 
                prior->next=currentNode; 
            } 
              prior = prior->next;  
        } 
        if((prior->gpa)>(currentNode->gpa)) 
        { 
            currentNode->next = prior->next; 
            prior->next=currentNode; 
        } 
 
       } 
         
 
        }//end for loop i 
 
        if(theList == 1) 
        { 
 
            uno = head; 
            currentNode = head; 
 
        // output sorted list of uno 
 
        cout << "\nSorted List of List UNO " << endl << endl; 
        cout << setw(5) << "Student Name " << setw(10) << "GPA " << endl; 
 
        while(currentNode != NULL) 
 
        { 
            cout << setw(6) << currentNode->name << setw(16) << currentNode->gpa << endl; 
 
            cout << setiosflags(ios::fixed|ios::showpoint|ios::right); 
            cout << setprecision(2); 
 
            currentNode = currentNode->next; 
 
        }//end while 
 
        } // end if 
 
        else  
        { 
            duo = head; 
            currentNode = head; 
                     
        // output sorted list of duo 
 
        cout << "\nSorted List of List DUO " << endl << endl; 
        cout << setw(5) << "Student Name " << setw(10) << "GPA " << endl; 
 
        while(currentNode != NULL) 
 
        { 
            cout << setw(6) << currentNode->name << setw(16) << currentNode->gpa << endl; 
 
            cout << setiosflags(ios::fixed|ios::showpoint|ios::right); 
            cout << setprecision(2); 
 
            currentNode = currentNode->next; 
 
        }//end while 
 
        } // end else 
             
 
    }//end for loop theList to process both lists 
 
 
    currentNode = uno; 
    prior = uno; 
 
    while (currentNode->gpa > 3.0) 
    { 
 
        currentNode = currentNode->next; 
        uno = currentNode; 
        prior = currentNode; 
    } 
        currentNode = currentNode->next; 
         
 
 
    while (currentNode->next != NULL)  
    { 
 
        if (currentNode->gpa > 3.0) 
        { 
 
            prior->next = currentNode->next; 
 
            currentNode = currentNode->next;  
 
        } 
        else 
        { 
 
        prior = currentNode; 
        currentNode = currentNode->next;  
 
        } 
     
    }//end for i 
 
    if (currentNode->gpa > 3.0) 
    { 
 
        prior->next = NULL; 
    } 
 
    currentNode = uno; 
 
    cout << "\nUNO List - All GPA's above 3.0 have been deleted " << endl << endl; 
    cout << setw(5) << "Student Name " << setw(10) << " GPA " << endl; 
 
        while(currentNode != NULL) 
 
        { 
 
            cout << setw(6) << currentNode->name << setw(16) << currentNode->gpa << endl; 
 
            cout << setiosflags(ios::fixed|ios::showpoint|ios::right); 
            cout << setprecision(2); 
 
            currentNode = currentNode->next; 
 
        }//end while 
 
 
    currentNode = duo; 
    prior = duo; 
 
    while (currentNode->gpa < 2.00)  
    { 
 
        currentNode = currentNode->next; 
        duo = currentNode; 
        prior = currentNode; 
    } 
        currentNode = currentNode->next; 
         
 
 
    while (currentNode->next != NULL) 
    { 
 
        if (currentNode->gpa < 2.5)  
        { 
 
            prior->next = currentNode->next; 
 
            currentNode = currentNode->next;  
 
        } 
        else 
        { 
 
        prior = currentNode; 
        currentNode = currentNode->next;  
 
        } 
 
        }//end for i 
 
    if (currentNode->gpa < 2.00) 
    { 
 
        prior->next = NULL; 
    } 
 
    currentNode = duo; 
 
    cout << "\nDUO List - All GPA's under 2.00 have been deleted" << endl << endl; 
    cout << setw(5) << "Student Name " << setw(10) << " GPA " << endl; 
     
 
        while(currentNode != NULL) 
 
        { 
 
            cout << setw(6) << currentNode->name << setw(16) << currentNode->gpa << endl; 
 
            cout << setiosflags(ios::fixed|ios::showpoint|ios::right); 
            cout << setprecision(2); 
            currentNode = currentNode->next; 
 
        }//end while 
    int xx; 
    cout <<" to end press xx"; 
    cin >> xx; 
         
    return 0; 
}//end main

There's his code, put up on the forums.

Here is the user's code he copied and pasted from elsewhere.

sigh - it was so on the cards. Why cant people just try properly themselves? It does not take much intelligence to realise you are going to have at least as much, - and probably more difficulty in hacking a large chunk of someone else's code, - which you have no comprehesion of - Than if you actually knuckled down and tried! Plus the bonus is - you might actually learn !

Well, the code is complete and utter garbage anyway, so you're better of doing it from scratch anyway if you want to learn.
And if you don't want to learn, well... then you've come to the wrong place.

Here goes another case of the stages of attempting to get someone else to do your work for you:
1. Try to get it for free.
2. Rip off others work and pretend that was their effort.
3. Denial. E.g. I didn't want to post my own code, but this code is similar.
4. Hurling abuse at those who wont help.
5. Begging others to do it for them.
6. Offering money to do it for them.
...
N. Handing in the plagurised work and claiming they misunderstood the question.

Pretty much everything worth saying has been said, so time to draw this to a close.