Simple program with list

Who can qiuckly write me a simple program with list based on smth like that:

Code:

---

struct s {
      double nr;
      struct s *next;
};

---

and with functions to:
- print the list
- add element at the beggining
- add element at the end
- add element after given value
- add element as sorted
- delete one element
- delete all elements of given value
- delete all elements

with some easy to understand names (of functions, variables etc) and with some comments to help me to understand program.

And i have a question? Why the hell is it double, and it doesn't work with int?

Please help me i have to show and it and explain to my teacher in few hours... :/

How not to get replies:

Quote:

---

Originally Posted by SebastianB

Who can qiuckly write me a simple program with list based on smth like that:

<snip>

Please help me i have to show and it and explain to my teacher in few hours... :/

---

http://cboard.cprogramming.com/annou...ouncementid=39

Well, okay then - if you want - here is my program. I wrote it but I don't understand it so who can help me (maybe by changing names and putting some comments)?

Code:

---

// Labs005.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"

struct s {
      double d;
      struct s *p;
};

struct s *inite(struct s *h);
struct s *pute(struct s *h);
void gete(struct s *h);
void removee(struct s *h);


int _tmain(int argc, _TCHAR* argv[])
{
       
        struct s *h;

  h=NULL;

  h=inite(h);
  pute(h);
  gete(h);
  removee(h);

  system("PAUSE"); 
  return 0;


}



struct s *inite(struct s *h) {
    struct s *p;         
   
    p = (struct s *) malloc(sizeof(struct s));
    if (p==NULL) printf("Pointer error");
    printf("Enter value: ");
    scanf("%lf", &(p->d));
    p->p=h;
    return p;
}

struct s *pute(struct s *h) {
    struct s *p, *q;

    p = (struct s *) malloc(sizeof(struct s));
    if (p==NULL) printf("Pointer error");
   
    p->p=NULL;
    printf("Enter value: ");
    scanf("%lf", &(p->d));
   
    if(h==NULL) return p;
    else {
        q=h;
        while  (q->p!=NULL) q=q->p;
        q->p=p;
        return h;
          }
}

void gete(struct s *h) {
    while (h!=NULL) {
          printf("\n%lf", h->d);
                  h=h->p;
    }
    printf("\n");
}

void removee(struct s *h) {
    struct s *p;

    while (h!=NULL) {
          p=h;
                  h=h->p;
                  free(p);
                  }
    free(h);
}

---

I know it seems strange that i wrote it without understanding it but it's true... :?

I have only a few questions. Anybody can help me? Maybe by some chat or smth like that? Please - only 1 hour left :/