Ordered list

#include <iostream>
using namespace std;
//кодът на Славова от презентацията

/*typedef struct element * po;
struct element {
    po next;
    int data;
};
int main()
{
    po na = NULL, p, contr;
    int x;
    cin >> x;
    p = new element;
    p->data = x;
    p->next = na;
    if (na == NULL || na->data >= x)
        na = p;
    else
    {
        do {
            contr = p->next;
            p->next = p->next->next;
        } while (p->next != NULL && p->next->data < x);
        contr->next = p;
    }
    //system("pause");
    return  0;
}*/

//кодът, който писахме в час на дъската
typedef Element * po;
struct Element {
    int Data;
    po Next;
};

int main() {
    po begging = NULL;
    po inv;
    po sl;
    int newEl;
    while (1)
    {
    po newEl = new Element;
    cout << "Enter data: ";
    if (begging != NULL)
    {
        cin >> newEl ->Data;
        inv = begging;
        sl = begging;

        while (!(inv == NULL || inv->Data > newEl->Data)) {
            inv = inv->Next;
        }
        while (!(sl->Next == inv)) {
            sl = sl->Next;
        }
        newEl->Next = inv;
        sl->Next = newEl;
    }
    else
    {
        newEl->Next = NULL;
        begging = newEl;
    }

    }
}