sorting a linked list

[nichodiaz]

I have managed to create a class that handles my linked list for me.

I am allowing a user to roll dice based on the command line arguments int given at run time.

the values our printed of the rolls summed together are put into a linked list.

I am trying to figure out what I need to do to add a function to may class which will sort the linked list in descending order and then another function that will sort the list in ascending order.

So essentially I would like to add two functions to my class,

1. A function that sorts my list.
2. A function that prints my list in Ascending order.
3. A function that prints my list in descending order.

This is my main.cpp

 
#include <time.h>
#include <stdlib.h>
#include <stdio.h>
#include <iostream>
#include <list>
#include <vector>
#include "linklist.h"

struct score {
    int d1;
    int d2;
    int total;
    int totals[13];
} score_dice1, score_dice2, score_total, score_totals;

int dice = 2;

void Randomize() {
    srand( (unsigned)time( NULL ) ) ;  }

int Random(int Max) { return ( rand() % Max)+ 1;     }

int main(int argc, char *argv[]) {
    
    linklist ll;
    
        if ( argc == 2 ) {
            
            int dice_rolls;
            dice_rolls = atoi(argv[1]);
            Randomize();
            for( dice = 2; dice <= 12; dice++)
                score_totals.totals[ dice ] = 0;                            for (dice = 0; dice < dice_rolls; dice++) {
                    score_dice1.d1 = Random(6) ;
                    score_dice2.d2 = Random(6) ;
                    score_total.total = score_dice1.d1 + score_dice2.d2;
                    
                    score_totals.totals[ score_total.total ]++; } for             (dice = 1; dice <= 13; dice++) {
                     
                    ll.append(score_totals.totals[ dice ]);
                    
                       ll.display(); std::cout << '\n';
                        
                    }
        } else {
            
            std::cout << "Dont be dumb..." << '\n'
            << "How many times should we roll the dice?" << '\n'
            << "One number please" << '\n';
        }
            return 0;
}

This is my class linklist.h

#pragma once

#ifndef LINKLIST_H
#define LINKLIST_H

#include <iostream>

class linklist
{
private:
    struct node
    {
        int data;
        node *link;
    }*p;
    
public:
    linklist();
    void append( int num );
    void add_as_first( int num );
    void addafter( int c, int num );
    void del( int num );
    void display();
    int count();
    ~linklist();
};

linklist::linklist()

{
    p=NULL;
}

void linklist::append(int num)
{
    node *q,*t;
    if( p == NULL )
    {
        p = new node;
        p->data = num;
        p->link = NULL;
    }
    else
    {
        q = p;
        while( q->link != NULL )
            q = q->link;
            t = new node;
            t->data = num;
            t->link = NULL;
            q->link = t;
            }
}
void linklist::add_as_first(int num)
{
    node *q;
    q = new node;
    q->data = num;
    q->link = p;
    p = q;
}
void linklist::addafter( int c, int num)
{

    node *q,*t;
    int i;
    for(i=0,q=p;i<c;i++)
    {
        q = q->link;
        if( q == NULL )
        {
            std::cout << "\nThere are less than " << c << " elements.";
            return;
            }
            }
            t = new node;
            t->data = num;
            t->link = q->link;
            q->link = t;
            }
            void linklist::del( int num )
            {
                node *q,*r;
                q = p;
                if( q->data == num )
                {
                    p = q->link;
                    delete q;
                
                    return;
                    
                }
                
                r = q;
                while( q!=NULL )
                {
                    if( q->data == num )
                        
                    {
                        r->link = q->link;
                        delete q;
                        return;
                    }
                    r = q;
                    q = q->link;
                }
                std::cout << "\nElement " << num << " not Found.";
            }

            void linklist::display()
            {
                node *q;
                int i = 0;
                std::cout << std::endl;
                for( q = p ; q != NULL ; q = q->link )
                    std::cout << std::endl << ++i << " " << q->data;
            }

            int linklist::count()
            {
                node *q;
                int c=0;
                for( q=p ; q != NULL ; q = q->link )
                    c++;
                return c;
            }

            linklist::~linklist()
            {
                node *q;
                if( p == NULL )
                    return;
                
                while( p != NULL )
                {
                    q = p->link;
                    delete p;
                    p = q;
                }
            }

#endif