temp = current -> next; current -> next = temp -> next; delete temp;

void cList::Task() { double AvValue; node *current=top; int sum=0; if(bot==0) { cout<<ToRus("Стек пуст.\n"); return; } for(int i=0;i<itsCount;i++) { sum+=current->value; current=current->next; } AvValue=double(sum)/itsCount; bool isDone=false; node *temp; while(!isDone) { isDone=true; current=top; while(current->next) { if(current->value < AvValue) { isDone=false; temp=current; current=current->next; delete temp; } else { current=current->next; } } } }

O->O->O->O

|-----v O O<-O O |-----^

#include <iostream> #include <stdlib.h> #include <conio.h> struct node { int value; node *next; }; class cList { public: cList(); ~cList(); void push(int value); //Äîáàâëÿåò ýëåìåíò â ñòåê int pop(); //Âîçâðàùàåò âåðõíèé ýëåìåíò, èçâëåêàÿ åãî èç ñòåêà void DeleteAll(); //Èçâëåêàåò âñå ýëåìåíòû void SortByAddress(); private: node *top; //Âåðõíèé ýëåìåíò, ïîñëåäíèì ïîìåùåííûé â ñòåê, ïåðâûì áóäåò èçâëåêàòüñÿ node *bot; //Ñàìûé íèæíèé ýëåìåíò, áóäåò èçâëå÷åí â ïîñëåäíþþ î÷åðåäü int itsCount; //Âîçìîæíî, âû çàõîòèòå ðåàëèçîâàòü ôóíêöèþ GetCount() }; cList::cList(): top(0), bot(0), itsCount(0) { } cList::~cList() { DeleteAll(); } void cList::push(int val) //Ëó÷øå íå äàâàòü ïåðåìåííûì, ïóñòü äàæå èç ðàçíûõ îáëàñòåé âèäèìîñòè, îäèíàêîâûå èìåíà - value â íàøåì ñëó÷àå { node* temp = new node; temp -> value = val; temp -> next = top; //Ìû â ëþáîì ñëó÷àå äîáàâëÿåì íîâûé ýëåìåíò top = temp; //Åñëè ñòåê áûë ïóñò, òî temp -> next == 0, íè÷åãî îñîáåííîãî if (bot == 0) //Åñëè äî âûïîëíåíèÿ ôóíêöèè íå áûëî äàæå íèæíåãî ýëåìåíòà (ñòåê áûë ïóñò) bot = top; } int cList::pop() { if (bot == 0) {/*Îøèáêà! Ñòåê ïóñò!*/ return -1;} else { int val = top -> value; if (top != bot) //Åñëè îñòàëîñü áîëüøå îäíîãî ýëåìåíòà { node* temp = top; top = top -> next; delete temp; } else { delete top; top = bot = 0; } return val; } } void cList::DeleteAll() { while (bot) //Ýêâèâàëåíòíî while (bot != 0), ò.å. äî òåõ ïîð, ïîêà åñòü õîòü îäèí ýëåìåíò pop(); } void cList::SortByAddress() { push(0); //Ïîìåùàåì âïåðåä âðåìåííûé ýëåìåíò node *current, *first, *second; node *temp = new node; bool isSorted = false; while(!isSorted) { isSorted = true; current = top; first = current -> next; //Äëÿ åäèíîîáðàçèÿ ñîáåðåì current, first è second âìåñòå second = first -> next; while(second->next) { if(first->value > second->value) { isSorted=false; first -> next = second -> next; second -> next = first; current -> next = second; } current = current -> next; //Îïÿòü æå ñîáèðàåì âìåñòå äëÿ ëó÷øåé ÷èòàåìîñòè first = current -> next; //next îò íîâîãî current second = first -> next; //Åñëè second == 0, òî ñëåäóþùàÿ èòåðàöèÿ íå âûïîëíèòñÿ } } pop(); //Èçâëåêàåì âðåìåííûé ýëåìåíò } int main() { cList List; for (int i = 0; i < 10; i++) List.push(i); List.SortByAddress(); for (int i = 0; i < 10; i++) std::cout << List.pop() << std::endl; getch(); }

void cList::SortByAdress() { push(0); node *current, *first, *second; node *temp; bool isSorted = false; while(!isSorted) { isSorted = true; current = top; first = current -> next; second = first -> next; while(second->next) { if(first->value > second->value) { isSorted=false; current->next=second; first->next=second->next; second->next=first; second=first; } current = first; first = current->next; second = first -> next; } } pop(); }

void cList::SortByAdress() { push(0); //Помещаем вперед временный элемент node *current, *first, *second; node *temp; bool isSorted = false; while(!isSorted) { isSorted = true; current = top; first = current -> next; //Для единообразия соберем current, first и second вместе second = first -> next; while(first->next) { if(first->value > second->value) { isSorted=false; temp=first; first=second; second=temp; } current = current -> next; //Опять же собираем вместе для лучшей читаемости first = current -> next; //next от нового current second = first -> next; //Если second == 0, то следующая итерация не выполнится } pop(); //Извлекаем временный элемент }

node* temp = new node; //Здесь нигде temp не упоминается temp = first;